./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:32:33,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:32:33,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:32:33,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:32:33,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:32:33,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:32:33,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:32:33,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:32:33,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:32:33,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:32:33,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:32:33,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:32:33,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:32:33,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:32:33,838 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:32:33,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:32:33,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:32:33,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:32:33,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:32:33,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:32:33,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:32:33,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:32:33,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:32:33,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:32:33,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:32:33,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:32:33,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:32:33,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:32:33,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:32:33,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:32:33,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:32:33,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:32:33,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:32:33,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:32:33,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:32:33,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:32:33,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:32:33,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:32:33,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:32:33,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:32:33,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:32:33,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:32:33,849 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d [2024-11-08 23:32:34,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:32:34,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:32:34,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:32:34,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:32:34,168 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:32:34,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-08 23:32:35,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:32:35,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:32:35,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-08 23:32:35,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb71d6a1/eb8e8c3455db4ad9bf868443f47bc58e/FLAGb5830faf4 [2024-11-08 23:32:36,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb71d6a1/eb8e8c3455db4ad9bf868443f47bc58e [2024-11-08 23:32:36,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:32:36,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:32:36,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:32:36,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:32:36,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:32:36,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d3df3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36, skipping insertion in model container [2024-11-08 23:32:36,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:32:36,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-08 23:32:36,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:32:36,495 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:32:36,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-08 23:32:36,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:32:36,579 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:32:36,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36 WrapperNode [2024-11-08 23:32:36,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:32:36,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:32:36,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:32:36,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:32:36,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,642 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-08 23:32:36,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:32:36,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:32:36,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:32:36,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:32:36,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,680 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:32:36,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:32:36,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:32:36,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:32:36,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:32:36,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (1/1) ... [2024-11-08 23:32:36,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:32:36,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:36,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:32:36,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:32:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:32:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:32:36,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:32:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:32:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:32:36,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:32:36,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:32:36,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:32:37,369 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 23:32:37,370 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:32:37,387 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:32:37,390 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:32:37,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:32:37 BoogieIcfgContainer [2024-11-08 23:32:37,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:32:37,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:32:37,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:32:37,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:32:37,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:32:36" (1/3) ... [2024-11-08 23:32:37,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4a5b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:32:37, skipping insertion in model container [2024-11-08 23:32:37,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:36" (2/3) ... [2024-11-08 23:32:37,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4a5b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:32:37, skipping insertion in model container [2024-11-08 23:32:37,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:32:37" (3/3) ... [2024-11-08 23:32:37,402 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-08 23:32:37,420 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:32:37,421 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:32:37,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:32:37,494 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@355dd91b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:32:37,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:32:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:32:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 23:32:37,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:37,511 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:37,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:37,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:37,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1211062472, now seen corresponding path program 1 times [2024-11-08 23:32:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:37,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287251672] [2024-11-08 23:32:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:37,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:32:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:32:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:32:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:32:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:32:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:32:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:32:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:32:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:32:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:32:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:32:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:37,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:32:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:32:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:32:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:32:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:32:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:32:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:32:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:32:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:32:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:32:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:32:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:32:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:32:38,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:38,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287251672] [2024-11-08 23:32:38,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287251672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:38,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:38,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:32:38,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332119362] [2024-11-08 23:32:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:38,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:32:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:38,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:32:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:32:38,131 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:32:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:38,173 INFO L93 Difference]: Finished difference Result 163 states and 280 transitions. [2024-11-08 23:32:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:32:38,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-11-08 23:32:38,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:38,185 INFO L225 Difference]: With dead ends: 163 [2024-11-08 23:32:38,185 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 23:32:38,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:32:38,193 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:38,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:32:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 23:32:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 23:32:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:32:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-11-08 23:32:38,245 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 160 [2024-11-08 23:32:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:38,246 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-11-08 23:32:38,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:32:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-11-08 23:32:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 23:32:38,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:38,252 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:38,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:32:38,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:38,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:38,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1796506252, now seen corresponding path program 1 times [2024-11-08 23:32:38,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:38,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39165161] [2024-11-08 23:32:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:32:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:32:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:32:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:32:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:32:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:32:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:32:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:32:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:32:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:32:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:32:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:32:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:32:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:32:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:38,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:32:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:39,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:32:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:39,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:32:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:39,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:32:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:32:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:32:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:39,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:32:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:39,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:32:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:39,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:32:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:32:39,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:39,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39165161] [2024-11-08 23:32:39,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39165161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:39,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:39,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:32:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104233785] [2024-11-08 23:32:39,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:39,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:32:39,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:39,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:32:39,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:32:39,087 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:32:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:39,330 INFO L93 Difference]: Finished difference Result 238 states and 364 transitions. [2024-11-08 23:32:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:32:39,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-11-08 23:32:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:39,338 INFO L225 Difference]: With dead ends: 238 [2024-11-08 23:32:39,338 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 23:32:39,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:32:39,341 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 106 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:39,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 347 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:32:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 23:32:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2024-11-08 23:32:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:32:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 198 transitions. [2024-11-08 23:32:39,390 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 198 transitions. Word has length 160 [2024-11-08 23:32:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:39,390 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 198 transitions. [2024-11-08 23:32:39,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:32:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 198 transitions. [2024-11-08 23:32:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 23:32:39,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:39,396 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:39,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:32:39,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:39,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:39,397 INFO L85 PathProgramCache]: Analyzing trace with hash -387667324, now seen corresponding path program 1 times [2024-11-08 23:32:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44427852] [2024-11-08 23:32:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:32:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:32:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:32:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:32:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:32:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:32:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:32:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:32:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:32:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:32:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:32:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:32:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:32:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:32:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:32:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:32:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:32:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:32:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:32:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:32:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:32:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:32:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:32:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:32:41,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:41,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44427852] [2024-11-08 23:32:41,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44427852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:41,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:41,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 23:32:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475536991] [2024-11-08 23:32:41,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:41,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:32:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:41,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:32:41,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:32:41,632 INFO L87 Difference]: Start difference. First operand 130 states and 198 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 23:32:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:43,247 INFO L93 Difference]: Finished difference Result 324 states and 482 transitions. [2024-11-08 23:32:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:32:43,248 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 161 [2024-11-08 23:32:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:43,252 INFO L225 Difference]: With dead ends: 324 [2024-11-08 23:32:43,252 INFO L226 Difference]: Without dead ends: 240 [2024-11-08 23:32:43,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-08 23:32:43,254 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 484 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:43,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 941 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 23:32:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-08 23:32:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 163. [2024-11-08 23:32:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 110 states have internal predecessors, (142), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:32:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2024-11-08 23:32:43,287 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 161 [2024-11-08 23:32:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:43,288 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2024-11-08 23:32:43,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 23:32:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2024-11-08 23:32:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 23:32:43,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:43,291 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:43,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:32:43,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:43,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 892196354, now seen corresponding path program 1 times [2024-11-08 23:32:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:43,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081186419] [2024-11-08 23:32:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:32:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:32:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:32:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:32:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:32:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:32:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:32:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:32:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:32:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:32:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:32:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:32:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:32:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:32:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:32:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:32:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:32:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:32:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:32:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:32:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:32:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:32:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:32:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:32:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081186419] [2024-11-08 23:32:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081186419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:32:44,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:32:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:32:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988214339] [2024-11-08 23:32:44,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:32:44,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:32:44,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:44,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:32:44,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:32:44,087 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:32:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:44,538 INFO L93 Difference]: Finished difference Result 409 states and 612 transitions. [2024-11-08 23:32:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:32:44,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-08 23:32:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:44,544 INFO L225 Difference]: With dead ends: 409 [2024-11-08 23:32:44,544 INFO L226 Difference]: Without dead ends: 331 [2024-11-08 23:32:44,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:32:44,546 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 228 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:44,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 571 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:32:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-08 23:32:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 234. [2024-11-08 23:32:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 163 states have (on average 1.343558282208589) internal successors, (219), 165 states have internal predecessors, (219), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 23:32:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 351 transitions. [2024-11-08 23:32:44,620 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 351 transitions. Word has length 161 [2024-11-08 23:32:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:44,621 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 351 transitions. [2024-11-08 23:32:44,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:32:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 351 transitions. [2024-11-08 23:32:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 23:32:44,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:44,628 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:44,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:32:44,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:44,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash -118920896, now seen corresponding path program 1 times [2024-11-08 23:32:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:44,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313619820] [2024-11-08 23:32:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:44,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:32:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:32:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:32:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:32:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:32:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:32:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:32:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:32:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:32:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:32:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:32:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:32:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:32:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:32:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:32:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:32:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:32:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:32:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:32:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:32:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:32:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:32:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:32:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 111 proven. 21 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-08 23:32:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:45,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313619820] [2024-11-08 23:32:45,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313619820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:32:45,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141777399] [2024-11-08 23:32:45,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:45,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:45,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:45,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:32:45,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:32:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:45,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 23:32:45,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:32:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 542 proven. 21 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2024-11-08 23:32:46,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:32:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 111 proven. 24 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 23:32:46,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141777399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:32:46,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:32:46,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 23 [2024-11-08 23:32:46,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667343179] [2024-11-08 23:32:46,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:32:46,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 23:32:46,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:46,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 23:32:46,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2024-11-08 23:32:46,585 INFO L87 Difference]: Start difference. First operand 234 states and 351 transitions. Second operand has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 8 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 8 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-08 23:32:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:47,511 INFO L93 Difference]: Finished difference Result 473 states and 693 transitions. [2024-11-08 23:32:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 23:32:47,512 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 8 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 8 states have call predecessors, (56), 8 states have call successors, (56) Word has length 161 [2024-11-08 23:32:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:47,516 INFO L225 Difference]: With dead ends: 473 [2024-11-08 23:32:47,516 INFO L226 Difference]: Without dead ends: 295 [2024-11-08 23:32:47,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=526, Invalid=1544, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 23:32:47,521 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 373 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:47,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 525 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:32:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-08 23:32:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 247. [2024-11-08 23:32:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 172 states have (on average 1.2906976744186047) internal successors, (222), 174 states have internal predecessors, (222), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 23:32:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 354 transitions. [2024-11-08 23:32:47,574 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 354 transitions. Word has length 161 [2024-11-08 23:32:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:47,574 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 354 transitions. [2024-11-08 23:32:47,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 8 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 8 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-08 23:32:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 354 transitions. [2024-11-08 23:32:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 23:32:47,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:47,579 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:47,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:32:47,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:47,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1976015226, now seen corresponding path program 1 times [2024-11-08 23:32:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226662273] [2024-11-08 23:32:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:47,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:32:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:32:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:32:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:32:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:32:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:32:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:32:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:32:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:32:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:32:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:32:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:32:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:32:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:32:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:32:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:32:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:32:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:32:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:32:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:32:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:32:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:32:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:32:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:32:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:32:48,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:32:48,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226662273] [2024-11-08 23:32:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226662273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:32:48,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908463430] [2024-11-08 23:32:48,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:48,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:48,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:48,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:32:48,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:32:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:32:48,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 23:32:48,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:32:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 518 proven. 72 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2024-11-08 23:32:48,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:32:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:32:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908463430] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:32:48,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:32:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-08 23:32:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404723008] [2024-11-08 23:32:48,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:32:48,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 23:32:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:32:48,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 23:32:48,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:32:48,855 INFO L87 Difference]: Start difference. First operand 247 states and 354 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-08 23:32:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:32:49,616 INFO L93 Difference]: Finished difference Result 532 states and 751 transitions. [2024-11-08 23:32:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 23:32:49,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 161 [2024-11-08 23:32:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:32:49,622 INFO L225 Difference]: With dead ends: 532 [2024-11-08 23:32:49,623 INFO L226 Difference]: Without dead ends: 352 [2024-11-08 23:32:49,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2024-11-08 23:32:49,625 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 261 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:32:49,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 570 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:32:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-08 23:32:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 251. [2024-11-08 23:32:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 174 states have (on average 1.2586206896551724) internal successors, (219), 176 states have internal predecessors, (219), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 23:32:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 351 transitions. [2024-11-08 23:32:49,682 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 351 transitions. Word has length 161 [2024-11-08 23:32:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:32:49,683 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 351 transitions. [2024-11-08 23:32:49,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-08 23:32:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 351 transitions. [2024-11-08 23:32:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 23:32:49,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:32:49,685 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:49,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:32:49,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 23:32:49,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:32:49,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:32:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1604090165, now seen corresponding path program 1 times [2024-11-08 23:32:49,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:32:49,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620321797] [2024-11-08 23:32:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:49,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:32:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:32:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940255541] [2024-11-08 23:32:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:32:50,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:50,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:50,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:32:50,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:32:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:32:50,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:32:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:32:50,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:32:50,556 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:32:50,557 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:32:50,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:32:50,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:32:50,763 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:32:50,925 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:32:50,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:32:50 BoogieIcfgContainer [2024-11-08 23:32:50,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:32:50,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:32:50,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:32:50,930 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:32:50,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:32:37" (3/4) ... [2024-11-08 23:32:50,934 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:32:50,935 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:32:50,936 INFO L158 Benchmark]: Toolchain (without parser) took 14767.55ms. Allocated memory was 176.2MB in the beginning and 394.3MB in the end (delta: 218.1MB). Free memory was 146.4MB in the beginning and 345.3MB in the end (delta: -198.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-08 23:32:50,936 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:32:50,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.17ms. Allocated memory is still 176.2MB. Free memory was 145.3MB in the beginning and 128.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:32:50,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.65ms. Allocated memory is still 176.2MB. Free memory was 128.4MB in the beginning and 124.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:32:50,938 INFO L158 Benchmark]: Boogie Preprocessor took 57.79ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 119.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:32:50,938 INFO L158 Benchmark]: RCFGBuilder took 689.16ms. Allocated memory is still 176.2MB. Free memory was 119.1MB in the beginning and 124.0MB in the end (delta: -4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:32:50,939 INFO L158 Benchmark]: TraceAbstraction took 13536.32ms. Allocated memory was 176.2MB in the beginning and 394.3MB in the end (delta: 218.1MB). Free memory was 124.0MB in the beginning and 346.3MB in the end (delta: -222.3MB). Peak memory consumption was 161.5MB. Max. memory is 16.1GB. [2024-11-08 23:32:50,939 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 394.3MB. Free memory was 346.3MB in the beginning and 345.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:32:50,941 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.17ms. Allocated memory is still 176.2MB. Free memory was 145.3MB in the beginning and 128.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.65ms. Allocated memory is still 176.2MB. Free memory was 128.4MB in the beginning and 124.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.79ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 119.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 689.16ms. Allocated memory is still 176.2MB. Free memory was 119.1MB in the beginning and 124.0MB in the end (delta: -4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13536.32ms. Allocated memory was 176.2MB in the beginning and 394.3MB in the end (delta: 218.1MB). Free memory was 124.0MB in the beginning and 346.3MB in the end (delta: -222.3MB). Peak memory consumption was 161.5MB. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 394.3MB. Free memory was 346.3MB in the beginning and 345.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -2; [L23] signed char var_1_4 = 0; [L24] signed char var_1_5 = -5; [L25] signed short int var_1_6 = -32; [L26] signed char var_1_7 = 8; [L27] unsigned char var_1_8 = 2; [L28] float var_1_10 = 15.6; [L29] unsigned char var_1_11 = 10; [L30] unsigned short int var_1_12 = 64; [L31] signed long int var_1_13 = -8; [L32] unsigned long int var_1_14 = 64; [L33] float var_1_17 = 9.75; [L34] float var_1_18 = 0.5; [L35] signed short int var_1_19 = -128; [L36] unsigned char var_1_21 = 1; [L37] unsigned long int var_1_22 = 3552880340; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 1; [L44] unsigned char var_1_29 = 0; [L45] signed short int var_1_30 = 10; [L46] float var_1_31 = 99.25; [L47] signed long int var_1_32 = 256; [L48] signed short int last_1_var_1_6 = -32; [L49] signed long int last_1_var_1_13 = -8; [L50] unsigned long int last_1_var_1_14 = 64; [L51] float last_1_var_1_17 = 9.75; [L52] signed short int last_1_var_1_19 = -128; [L53] unsigned char last_1_var_1_21 = 1; [L54] float last_1_var_1_31 = 99.25; [L55] signed long int last_1_var_1_32 = 256; VAL [isInitial=0, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L175] last_1_var_1_6 = var_1_6 [L176] last_1_var_1_13 = var_1_13 [L177] last_1_var_1_14 = var_1_14 [L178] last_1_var_1_17 = var_1_17 [L179] last_1_var_1_19 = var_1_19 [L180] last_1_var_1_21 = var_1_21 [L181] last_1_var_1_31 = var_1_31 [L182] last_1_var_1_32 = var_1_32 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L137] var_1_4 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L138] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L139] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L139] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L140] var_1_5 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L141] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L142] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L142] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L143] var_1_7 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_7 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L144] RET assume_abort_if_not(var_1_7 >= -128) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L145] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L145] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L146] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L146] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L147] var_1_10 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L148] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L149] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L149] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L150] var_1_11 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L151] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L152] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L152] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L153] var_1_18 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L154] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L155] var_1_22 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L156] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L157] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L157] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L158] var_1_23 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L159] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L160] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L160] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L161] var_1_24 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L162] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L163] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L163] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L164] var_1_26 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L165] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L166] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L166] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L167] var_1_27 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L169] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L169] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L171] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L172] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L172] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L193] RET updateVariables() [L194] CALL step() [L59] COND FALSE !(-2 == last_1_var_1_32) [L66] var_1_1 = (var_1_5 + 5) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L68] var_1_32 = var_1_1 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L69] COND TRUE var_1_5 > (last_1_var_1_13 % var_1_7) [L70] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L74] unsigned char stepLocal_4 = (- var_1_18) > last_1_var_1_31; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_4=1, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L75] COND TRUE last_1_var_1_21 || stepLocal_4 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L76] COND FALSE !(! last_1_var_1_21) [L79] var_1_25 = var_1_24 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L84] var_1_12 = var_1_11 [L85] var_1_30 = var_1_1 [L86] var_1_31 = 24.4f [L87] unsigned char stepLocal_0 = (var_1_31 / var_1_10) < 255.625f; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_0=1, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L88] COND TRUE stepLocal_0 && (var_1_7 < (var_1_5 * -100)) [L89] var_1_8 = (((((128 - var_1_4)) > (var_1_11)) ? ((128 - var_1_4)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L93] signed char stepLocal_5 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_5=-13, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L94] COND TRUE stepLocal_5 <= (~ var_1_1) [L95] var_1_28 = (! (! (var_1_24 && var_1_29))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L99] COND TRUE var_1_25 || var_1_28 [L100] var_1_14 = ((last_1_var_1_14 + 1u) + var_1_11) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L102] COND TRUE (64 - ((((-64) < 0 ) ? -(-64) : (-64)))) <= (var_1_14 + (var_1_8 * var_1_4)) [L103] var_1_17 = 100.5f VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L107] COND FALSE !((var_1_31 + (var_1_10 + var_1_31)) > (var_1_18 * var_1_17)) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L114] signed char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_1=-1, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L115] COND TRUE ((last_1_var_1_6 * var_1_11) / 10) <= stepLocal_1 [L116] var_1_13 = (var_1_7 + (var_1_11 - ((((last_1_var_1_13) < (last_1_var_1_32)) ? (last_1_var_1_13) : (last_1_var_1_32))))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L124] EXPR 256u & var_1_13 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L124] unsigned char stepLocal_3 = (256u & var_1_13) == (var_1_22 - var_1_12); [L125] unsigned short int stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_2=5, stepLocal_3=0, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L126] COND TRUE stepLocal_3 || var_1_25 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_2=5, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L127] COND TRUE var_1_13 != stepLocal_2 [L128] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=0, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((((((((-2 == last_1_var_1_32) ? (((last_1_var_1_32 * last_1_var_1_6) <= -500) ? (var_1_1 == ((signed char) ((((2 - var_1_4) < 0 ) ? -(2 - var_1_4) : (2 - var_1_4))))) : (var_1_1 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) : (var_1_1 == ((signed char) (var_1_5 + 5)))) && ((var_1_5 > (last_1_var_1_13 % var_1_7)) ? (var_1_6 == ((signed short int) var_1_5)) : (var_1_6 == ((signed short int) (var_1_5 + var_1_7))))) && ((((var_1_31 / var_1_10) < 255.625f) && (var_1_7 < (var_1_5 * -100))) ? (var_1_8 == ((unsigned char) (((((128 - var_1_4)) > (var_1_11)) ? ((128 - var_1_4)) : (var_1_11))))) : (var_1_8 == ((unsigned char) var_1_4)))) && (var_1_12 == ((unsigned short int) var_1_11))) && ((((last_1_var_1_6 * var_1_11) / 10) <= var_1_5) ? (var_1_13 == ((signed long int) (var_1_7 + (var_1_11 - ((((last_1_var_1_13) < (last_1_var_1_32)) ? (last_1_var_1_13) : (last_1_var_1_32))))))) : (((- (- last_1_var_1_17)) < var_1_10) ? (var_1_13 == ((signed long int) (var_1_7 + var_1_5))) : (var_1_13 == ((signed long int) var_1_4))))) && ((var_1_25 || var_1_28) ? (var_1_14 == ((unsigned long int) ((last_1_var_1_14 + 1u) + var_1_11))) : 1)) && (((64 - ((((-64) < 0 ) ? -(-64) : (-64)))) <= (var_1_14 + (var_1_8 * var_1_4))) ? (var_1_17 == ((float) 100.5f)) : (var_1_17 == ((float) var_1_18)))) && (((var_1_31 + (var_1_10 + var_1_31)) > (var_1_18 * var_1_17)) ? (var_1_25 ? (var_1_19 == ((signed short int) var_1_7)) : (var_1_19 == ((signed short int) last_1_var_1_19))) : 1)) && ((((256u & var_1_13) == (var_1_22 - var_1_12)) || var_1_25) ? ((var_1_13 != var_1_12) ? (var_1_21 == ((unsigned char) var_1_23)) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=0, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L185-L186] return ((((((((((((((-2 == last_1_var_1_32) ? (((last_1_var_1_32 * last_1_var_1_6) <= -500) ? (var_1_1 == ((signed char) ((((2 - var_1_4) < 0 ) ? -(2 - var_1_4) : (2 - var_1_4))))) : (var_1_1 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) : (var_1_1 == ((signed char) (var_1_5 + 5)))) && ((var_1_5 > (last_1_var_1_13 % var_1_7)) ? (var_1_6 == ((signed short int) var_1_5)) : (var_1_6 == ((signed short int) (var_1_5 + var_1_7))))) && ((((var_1_31 / var_1_10) < 255.625f) && (var_1_7 < (var_1_5 * -100))) ? (var_1_8 == ((unsigned char) (((((128 - var_1_4)) > (var_1_11)) ? ((128 - var_1_4)) : (var_1_11))))) : (var_1_8 == ((unsigned char) var_1_4)))) && (var_1_12 == ((unsigned short int) var_1_11))) && ((((last_1_var_1_6 * var_1_11) / 10) <= var_1_5) ? (var_1_13 == ((signed long int) (var_1_7 + (var_1_11 - ((((last_1_var_1_13) < (last_1_var_1_32)) ? (last_1_var_1_13) : (last_1_var_1_32))))))) : (((- (- last_1_var_1_17)) < var_1_10) ? (var_1_13 == ((signed long int) (var_1_7 + var_1_5))) : (var_1_13 == ((signed long int) var_1_4))))) && ((var_1_25 || var_1_28) ? (var_1_14 == ((unsigned long int) ((last_1_var_1_14 + 1u) + var_1_11))) : 1)) && (((64 - ((((-64) < 0 ) ? -(-64) : (-64)))) <= (var_1_14 + (var_1_8 * var_1_4))) ? (var_1_17 == ((float) 100.5f)) : (var_1_17 == ((float) var_1_18)))) && (((var_1_31 + (var_1_10 + var_1_31)) > (var_1_18 * var_1_17)) ? (var_1_25 ? (var_1_19 == ((signed short int) var_1_7)) : (var_1_19 == ((signed short int) last_1_var_1_19))) : 1)) && ((((256u & var_1_13) == (var_1_22 - var_1_12)) || var_1_25) ? ((var_1_13 != var_1_12) ? (var_1_21 == ((unsigned char) var_1_23)) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_24)))) && ((last_1_var_1_21 || ((- var_1_18) > last_1_var_1_31)) ? ((! last_1_var_1_21) ? (var_1_25 == ((unsigned char) ((var_1_23 || var_1_26) || var_1_27))) : (var_1_25 == ((unsigned char) var_1_24))) : (var_1_25 == ((unsigned char) var_1_24)))) && ((var_1_7 <= (~ var_1_1)) ? (var_1_28 == ((unsigned char) (! (! (var_1_24 && var_1_29))))) : (var_1_28 == ((unsigned char) ((var_1_31 == 8.5f) || (var_1_29 && var_1_24)))))) && (var_1_30 == ((signed short int) var_1_1))) && (var_1_31 == ((float) 24.4f))) && (var_1_32 == ((signed long int) var_1_1)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=0, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=0, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1502 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1452 mSDsluCounter, 3077 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2218 mSDsCounter, 605 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1823 IncrementalHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 605 mSolverCounterUnsat, 859 mSDtfsCounter, 1823 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 951 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=6, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 353 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1610 NumberOfCodeBlocks, 1610 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1598 ConstructedInterpolants, 0 QuantifiedInterpolants, 7051 SizeOfPredicates, 9 NumberOfNonLiveVariables, 826 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 10860/11040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:32:50,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:32:53,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:32:53,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:32:53,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:32:53,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:32:53,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:32:53,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:32:53,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:32:53,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:32:53,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:32:53,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:32:53,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:32:53,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:32:53,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:32:53,548 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:32:53,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:32:53,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:32:53,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:32:53,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:32:53,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:32:53,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:32:53,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:32:53,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:32:53,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:32:53,553 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:32:53,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:32:53,553 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:32:53,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:32:53,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:32:53,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:32:53,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:32:53,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:32:53,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:32:53,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:32:53,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:32:53,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:32:53,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:32:53,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:32:53,559 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:32:53,560 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:32:53,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:32:53,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:32:53,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:32:53,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:32:53,561 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d [2024-11-08 23:32:53,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:32:53,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:32:53,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:32:53,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:32:53,959 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:32:53,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-08 23:32:55,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:32:55,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:32:55,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-08 23:32:55,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6026ebe36/cb70680380f249a0811cbeff175ead80/FLAG7e5a1b103 [2024-11-08 23:32:55,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6026ebe36/cb70680380f249a0811cbeff175ead80 [2024-11-08 23:32:55,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:32:55,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:32:55,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:32:55,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:32:55,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:32:55,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:32:55" (1/1) ... [2024-11-08 23:32:55,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59278423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:55, skipping insertion in model container [2024-11-08 23:32:55,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:32:55" (1/1) ... [2024-11-08 23:32:55,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:32:56,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-08 23:32:56,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:32:56,253 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:32:56,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-08 23:32:56,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:32:56,360 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:32:56,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56 WrapperNode [2024-11-08 23:32:56,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:32:56,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:32:56,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:32:56,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:32:56,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,434 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-08 23:32:56,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:32:56,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:32:56,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:32:56,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:32:56,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,479 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:32:56,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:32:56,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:32:56,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:32:56,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:32:56,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (1/1) ... [2024-11-08 23:32:56,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:32:56,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:32:56,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:32:56,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:32:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:32:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:32:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:32:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:32:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:32:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:32:56,705 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:32:56,707 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:33:05,474 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 23:33:05,474 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:33:05,491 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:33:05,492 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:33:05,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:33:05 BoogieIcfgContainer [2024-11-08 23:33:05,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:33:05,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:33:05,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:33:05,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:33:05,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:32:55" (1/3) ... [2024-11-08 23:33:05,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f408ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:33:05, skipping insertion in model container [2024-11-08 23:33:05,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:32:56" (2/3) ... [2024-11-08 23:33:05,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f408ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:33:05, skipping insertion in model container [2024-11-08 23:33:05,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:33:05" (3/3) ... [2024-11-08 23:33:05,500 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-08 23:33:05,514 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:33:05,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:33:05,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:33:05,580 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@464f2293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:33:05,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:33:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:33:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:33:05,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:33:05,606 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:33:05,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:33:05,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:33:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash 911881905, now seen corresponding path program 1 times [2024-11-08 23:33:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:33:05,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737286227] [2024-11-08 23:33:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:33:05,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:33:05,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:33:05,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:33:05,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:33:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:06,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:33:06,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-08 23:33:06,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:33:06,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:33:06,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737286227] [2024-11-08 23:33:06,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737286227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:33:06,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:33:06,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:33:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311167017] [2024-11-08 23:33:06,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:33:06,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:33:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:33:06,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:33:06,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:33:06,273 INFO L87 Difference]: Start difference. First operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:33:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:33:06,311 INFO L93 Difference]: Finished difference Result 145 states and 252 transitions. [2024-11-08 23:33:06,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:33:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-11-08 23:33:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:33:06,323 INFO L225 Difference]: With dead ends: 145 [2024-11-08 23:33:06,323 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 23:33:06,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:33:06,334 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:33:06,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:33:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 23:33:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-08 23:33:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:33:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2024-11-08 23:33:06,392 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 157 [2024-11-08 23:33:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:33:06,393 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2024-11-08 23:33:06,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:33:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2024-11-08 23:33:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:33:06,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:33:06,400 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:33:06,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:33:06,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:33:06,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:33:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:33:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1627849581, now seen corresponding path program 1 times [2024-11-08 23:33:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:33:06,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370470356] [2024-11-08 23:33:06,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:33:06,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:33:06,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:33:06,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:33:06,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:33:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:07,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:07,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:33:08,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:33:08,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:33:08,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370470356] [2024-11-08 23:33:08,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370470356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:33:08,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:33:08,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:33:08,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069792166] [2024-11-08 23:33:08,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:33:08,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:33:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:33:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:33:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:33:08,995 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:33:13,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:33:15,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:33:19,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:33:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:33:19,914 INFO L93 Difference]: Finished difference Result 211 states and 322 transitions. [2024-11-08 23:33:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:33:19,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-08 23:33:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:33:19,962 INFO L225 Difference]: With dead ends: 211 [2024-11-08 23:33:19,962 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 23:33:19,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:33:19,964 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 84 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:33:19,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 306 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 10.8s Time] [2024-11-08 23:33:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 23:33:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 121. [2024-11-08 23:33:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:33:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2024-11-08 23:33:20,007 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 157 [2024-11-08 23:33:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:33:20,008 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2024-11-08 23:33:20,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:33:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2024-11-08 23:33:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 23:33:20,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:33:20,012 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:33:20,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:33:20,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:33:20,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:33:20,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:33:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1305132533, now seen corresponding path program 1 times [2024-11-08 23:33:20,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:33:20,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285307144] [2024-11-08 23:33:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:33:20,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:33:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:33:20,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:33:20,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:33:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:20,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:33:20,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 512 proven. 36 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-08 23:33:22,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:33:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:33:24,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:33:24,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285307144] [2024-11-08 23:33:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285307144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:33:24,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:33:24,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-08 23:33:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484042647] [2024-11-08 23:33:24,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:33:24,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:33:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:33:24,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:33:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:33:24,064 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 23:33:29,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:33:35,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:33:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:33:36,611 INFO L93 Difference]: Finished difference Result 360 states and 521 transitions. [2024-11-08 23:33:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 23:33:36,612 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 158 [2024-11-08 23:33:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:33:36,616 INFO L225 Difference]: With dead ends: 360 [2024-11-08 23:33:36,616 INFO L226 Difference]: Without dead ends: 291 [2024-11-08 23:33:36,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 23:33:36,619 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 180 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 105 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:33:36,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 531 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 524 Invalid, 1 Unknown, 0 Unchecked, 11.0s Time] [2024-11-08 23:33:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-08 23:33:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 150. [2024-11-08 23:33:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 95 states have internal predecessors, (118), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:33:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 214 transitions. [2024-11-08 23:33:36,653 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 214 transitions. Word has length 158 [2024-11-08 23:33:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:33:36,658 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 214 transitions. [2024-11-08 23:33:36,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 23:33:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2024-11-08 23:33:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 23:33:36,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:33:36,660 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:33:36,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 23:33:36,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:33:36,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:33:36,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:33:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1568842632, now seen corresponding path program 1 times [2024-11-08 23:33:36,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:33:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826970902] [2024-11-08 23:33:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:33:36,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:33:36,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:33:36,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:33:36,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 23:33:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:37,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-08 23:33:37,306 INFO L278 TraceCheckSpWp]: Computing forward predicates...