./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.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-1loop_file-9.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 cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:25:32,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:25:32,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:25:32,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:25:32,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:25:32,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:25:32,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:25:32,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:25:32,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:25:32,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:25:32,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:25:32,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:25:32,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:25:32,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:25:32,997 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:25:32,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:25:32,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:25:32,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:25:32,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:25:32,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:25:32,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:25:32,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:25:32,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:25:32,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:25:32,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:25:32,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:25:32,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:25:32,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:25:32,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:25:33,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:25:33,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:25:33,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:25:33,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:33,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:25:33,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:25:33,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:25:33,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:25:33,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:25:33,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:25:33,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:25:33,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:25:33,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:25:33,003 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 -> cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 [2024-11-08 23:25:33,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:25:33,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:25:33,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:25:33,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:25:33,241 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:25:33,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-11-08 23:25:34,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:25:34,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:25:34,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-11-08 23:25:34,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9a09c4f/3fcfa523f6df4548986379ce89d2d4f8/FLAG613571a64 [2024-11-08 23:25:35,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9a09c4f/3fcfa523f6df4548986379ce89d2d4f8 [2024-11-08 23:25:35,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:25:35,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:25:35,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:35,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:25:35,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:25:35,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634e5865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35, skipping insertion in model container [2024-11-08 23:25:35,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:25:35,179 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-1loop_file-9.i[915,928] [2024-11-08 23:25:35,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:35,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:25:35,275 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-1loop_file-9.i[915,928] [2024-11-08 23:25:35,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:35,313 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:25:35,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35 WrapperNode [2024-11-08 23:25:35,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:35,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:35,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:25:35,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:25:35,319 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:25:35" (1/1) ... [2024-11-08 23:25:35,330 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:25:35" (1/1) ... [2024-11-08 23:25:35,367 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-11-08 23:25:35,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:35,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:25:35,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:25:35,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:25:35,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,404 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:25:35,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:25:35,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:25:35,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:25:35,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:25:35,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (1/1) ... [2024-11-08 23:25:35,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:35,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:25:35,482 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:25:35,484 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:25:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:25:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:25:35,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:25:35,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:25:35,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:25:35,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:25:35,631 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:25:35,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:25:36,085 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 23:25:36,086 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:25:36,096 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:25:36,096 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:25:36,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:36 BoogieIcfgContainer [2024-11-08 23:25:36,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:25:36,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:25:36,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:25:36,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:25:36,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:25:35" (1/3) ... [2024-11-08 23:25:36,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aca49d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:36, skipping insertion in model container [2024-11-08 23:25:36,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:35" (2/3) ... [2024-11-08 23:25:36,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aca49d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:36, skipping insertion in model container [2024-11-08 23:25:36,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:36" (3/3) ... [2024-11-08 23:25:36,102 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-11-08 23:25:36,114 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:25:36,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:25:36,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:25:36,161 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;@2bc90314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:25:36,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:25:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 80 states have (on average 1.5) internal successors, (120), 81 states have internal predecessors, (120), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:25:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 23:25:36,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:36,182 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:36,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1779291685, now seen corresponding path program 1 times [2024-11-08 23:25:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:36,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660740442] [2024-11-08 23:25:36,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:25:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:25:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:25:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:25:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:25:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:25:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:25:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:25:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:25:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:25:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:25:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:25:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:25:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:25:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:25:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:25:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:25:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:25:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:25:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:25:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:25:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:25:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:25:36,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:36,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660740442] [2024-11-08 23:25:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660740442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:36,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:36,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:25:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112781120] [2024-11-08 23:25:36,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:36,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:25:36,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:36,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:25:36,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:25:36,559 INFO L87 Difference]: Start difference. First operand has 109 states, 80 states have (on average 1.5) internal successors, (120), 81 states have internal predecessors, (120), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:25:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:36,586 INFO L93 Difference]: Finished difference Result 214 states and 365 transitions. [2024-11-08 23:25:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:25:36,587 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-08 23:25:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:36,595 INFO L225 Difference]: With dead ends: 214 [2024-11-08 23:25:36,595 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 23:25:36,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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:25:36,600 INFO L432 NwaCegarLoop]: 163 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, 163 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:25:36,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 23:25:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-08 23:25:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:25:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2024-11-08 23:25:36,663 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 171 [2024-11-08 23:25:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:36,664 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2024-11-08 23:25:36,664 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:25:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2024-11-08 23:25:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 23:25:36,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:36,667 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:25:36,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:36,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash 183013597, now seen corresponding path program 1 times [2024-11-08 23:25:36,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:36,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016385702] [2024-11-08 23:25:36,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:36,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:25:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:25:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:25:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:25:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:25:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:25:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:25:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:25:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:25:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:25:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:25:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:25:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:25:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:25:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:25:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:25:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:25:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:25:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:25:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:25:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:25:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:25:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:25:36,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:36,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016385702] [2024-11-08 23:25:36,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016385702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:36,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:25:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357844081] [2024-11-08 23:25:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:25:36,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:25:36,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:36,887 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:25:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:36,956 INFO L93 Difference]: Finished difference Result 250 states and 379 transitions. [2024-11-08 23:25:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:25:36,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-08 23:25:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:36,962 INFO L225 Difference]: With dead ends: 250 [2024-11-08 23:25:36,962 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 23:25:36,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:36,965 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 76 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:36,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 315 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 23:25:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-08 23:25:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 115 states have (on average 1.382608695652174) internal successors, (159), 116 states have internal predecessors, (159), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:25:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 215 transitions. [2024-11-08 23:25:36,990 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 215 transitions. Word has length 171 [2024-11-08 23:25:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:36,990 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 215 transitions. [2024-11-08 23:25:36,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:25:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 215 transitions. [2024-11-08 23:25:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 23:25:36,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:36,993 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:25:36,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:36,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2005800520, now seen corresponding path program 1 times [2024-11-08 23:25:36,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:36,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918850878] [2024-11-08 23:25:36,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:36,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:25:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:25:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:25:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:25:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:25:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:25:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:25:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:25:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:25:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:25:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:25:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:25:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:25:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:25:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:25:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:25:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:25:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:25:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:25:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:25:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:25:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:25:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:25:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918850878] [2024-11-08 23:25:37,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918850878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:37,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:25:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213554992] [2024-11-08 23:25:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:37,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:25:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:25:37,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:25:37,314 INFO L87 Difference]: Start difference. First operand 146 states and 215 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:25:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:37,479 INFO L93 Difference]: Finished difference Result 426 states and 632 transitions. [2024-11-08 23:25:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:25:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-08 23:25:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:37,485 INFO L225 Difference]: With dead ends: 426 [2024-11-08 23:25:37,488 INFO L226 Difference]: Without dead ends: 283 [2024-11-08 23:25:37,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:25:37,490 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 122 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:37,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 458 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:25:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-08 23:25:37,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 194. [2024-11-08 23:25:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 137 states have internal predecessors, (181), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 23:25:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2024-11-08 23:25:37,517 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 172 [2024-11-08 23:25:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:37,518 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2024-11-08 23:25:37,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:25:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2024-11-08 23:25:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 23:25:37,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:37,520 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:37,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:25:37,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:37,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:37,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1138347864, now seen corresponding path program 1 times [2024-11-08 23:25:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:37,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801934804] [2024-11-08 23:25:37,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:37,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:25:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:25:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:25:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:25:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:25:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:25:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:25:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:25:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:25:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:25:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:25:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:25:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:25:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:25:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:25:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:25:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:25:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:25:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:25:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:25:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:25:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:25:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:25:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801934804] [2024-11-08 23:25:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801934804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:37,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:37,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:25:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85958093] [2024-11-08 23:25:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:37,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:25:37,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:37,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:25:37,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:37,710 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:25:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:37,746 INFO L93 Difference]: Finished difference Result 480 states and 713 transitions. [2024-11-08 23:25:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:25:37,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-08 23:25:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:37,751 INFO L225 Difference]: With dead ends: 480 [2024-11-08 23:25:37,751 INFO L226 Difference]: Without dead ends: 337 [2024-11-08 23:25:37,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:37,753 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 105 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:37,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 306 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-08 23:25:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2024-11-08 23:25:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 249 states have internal predecessors, (332), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-08 23:25:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 496 transitions. [2024-11-08 23:25:37,790 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 496 transitions. Word has length 173 [2024-11-08 23:25:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:37,790 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 496 transitions. [2024-11-08 23:25:37,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:25:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 496 transitions. [2024-11-08 23:25:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 23:25:37,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:37,793 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:37,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:25:37,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash 296128839, now seen corresponding path program 1 times [2024-11-08 23:25:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:37,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657506523] [2024-11-08 23:25:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:25:37,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1576129461] [2024-11-08 23:25:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:37,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:25:37,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:25:37,943 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:25:37,945 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:25:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:25:38,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:25:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:25:38,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:25:38,194 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:25:38,195 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:25:38,204 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:25:38,397 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:25:38,400 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 23:25:38,502 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:25:38,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:25:38 BoogieIcfgContainer [2024-11-08 23:25:38,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:25:38,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:25:38,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:25:38,505 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:25:38,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:36" (3/4) ... [2024-11-08 23:25:38,507 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:25:38,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:25:38,508 INFO L158 Benchmark]: Toolchain (without parser) took 3500.17ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 133.0MB in the beginning and 84.2MB in the end (delta: 48.7MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2024-11-08 23:25:38,508 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:25:38,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.41ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 115.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:25:38,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.99ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 106.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:25:38,509 INFO L158 Benchmark]: Boogie Preprocessor took 76.18ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 99.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:25:38,509 INFO L158 Benchmark]: RCFGBuilder took 651.79ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 100.1MB in the end (delta: -676.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:25:38,509 INFO L158 Benchmark]: TraceAbstraction took 2406.35ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 99.2MB in the beginning and 84.2MB in the end (delta: 15.0MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-11-08 23:25:38,509 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 216.0MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:25:38,512 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.13ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.41ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 115.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.99ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 106.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.18ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 99.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 651.79ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 100.1MB in the end (delta: -676.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2406.35ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 99.2MB in the beginning and 84.2MB in the end (delta: 15.0MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 216.0MB. Free memory is still 84.2MB. There was no memory consumed. 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 someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] double var_1_4 = 99999999999.6; [L24] unsigned char var_1_5 = 1; [L25] signed long int var_1_6 = -5; [L26] signed char var_1_10 = 64; [L27] signed char var_1_11 = 16; [L28] signed char var_1_12 = 4; [L29] signed char var_1_13 = 64; [L30] unsigned short int var_1_14 = 64; [L31] unsigned char var_1_16 = 8; [L32] unsigned char var_1_17 = 200; [L33] unsigned char var_1_18 = 1; [L34] signed long int var_1_19 = 10; [L35] signed long int var_1_20 = -256; [L36] signed char var_1_21 = 25; [L37] signed char var_1_23 = 1; [L38] signed char var_1_24 = 5; [L39] unsigned char var_1_25 = 0; [L40] double var_1_26 = 8.125; [L41] double var_1_27 = 0.875; [L42] double var_1_28 = 15.6; [L43] double var_1_29 = 2.5; [L44] unsigned long int var_1_30 = 25; [L45] signed long int var_1_31 = 50; [L46] signed short int var_1_32 = -8; [L47] unsigned char var_1_33 = 100; [L48] signed long int last_1_var_1_6 = -5; [L49] signed long int last_1_var_1_20 = -256; [L50] signed char last_1_var_1_21 = 25; VAL [isInitial=0, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L203] isInitial = 1 [L204] FCALL initially() [L205] int k_loop; [L206] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L206] COND TRUE k_loop < 1 [L207] CALL updateLastVariables() [L194] last_1_var_1_6 = var_1_6 [L195] last_1_var_1_20 = var_1_20 [L196] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L153] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L155] var_1_5 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L156] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L157] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L157] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L158] var_1_11 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L159] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L161] var_1_12 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L162] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L164] var_1_13 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L167] var_1_17 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_17 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L168] RET assume_abort_if_not(var_1_17 >= 190) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L170] var_1_18 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L171] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L173] var_1_23 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L174] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L176] var_1_24 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L177] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L182] var_1_27 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L183] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L184] var_1_28 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L185] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L186] var_1_29 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L187] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L188] var_1_31 = __VERIFIER_nondet_long() [L189] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L189] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] CALL assume_abort_if_not(var_1_31 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] RET assume_abort_if_not(var_1_31 != 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L208] RET updateVariables() [L209] CALL step() [L54] COND TRUE \read(var_1_5) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L55] COND TRUE (last_1_var_1_6 < 1) || var_1_25 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L56] COND TRUE \read(var_1_25) [L57] var_1_26 = ((var_1_27 - var_1_28) + var_1_29) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L65] COND FALSE !((- var_1_26) >= (var_1_26 / var_1_4)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=25, var_1_31=62, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L70] var_1_32 = var_1_23 [L71] var_1_33 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=25, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L72] COND FALSE !(! var_1_5) [L87] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=25, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L89] COND FALSE !(var_1_1 == 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=25, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L92] COND FALSE !(var_1_14 < var_1_1) [L95] var_1_6 = var_1_1 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=25, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L98] unsigned short int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=8, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=25, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L99] COND FALSE !(! var_1_5) [L104] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=25, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L106] var_1_19 = var_1_16 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=25, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L107] COND FALSE !(((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) [L114] var_1_30 = var_1_33 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L116] COND TRUE \read(var_1_5) [L117] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L125] COND TRUE \read(var_1_5) [L126] var_1_20 = -10000000 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L142] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L143] EXPR last_1_var_1_21 & var_1_10 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L143] COND TRUE ((last_1_var_1_21 & var_1_10) >= var_1_12) && stepLocal_1 [L144] var_1_21 = (var_1_18 + (var_1_23 - var_1_24)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=33, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L209] RET step() [L210] CALL, EXPR property() [L199] EXPR ((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14)))) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=33, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L199] EXPR (((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=33, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L199-L200] return (((((((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1))) && (var_1_5 ? (((last_1_var_1_6 < 1) || var_1_25) ? (var_1_25 ? (var_1_26 == ((double) ((var_1_27 - var_1_28) + var_1_29))) : 1) : (var_1_26 == ((double) var_1_28))) : (var_1_26 == ((double) var_1_28)))) && ((((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) ? ((var_1_16 > var_1_16) ? (var_1_30 == ((unsigned long int) var_1_18)) : (var_1_30 == ((unsigned long int) var_1_17))) : (var_1_30 == ((unsigned long int) var_1_33)))) && (var_1_32 == ((signed short int) var_1_23))) && (var_1_33 == ((unsigned char) var_1_18)) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=33, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=191, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=33, var_1_23=0, var_1_24=0, var_1_25=1, var_1_30=33, var_1_31=62, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 303 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 1242 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 565 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 677 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 94 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1035 NumberOfCodeBlocks, 1035 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 683 ConstructedInterpolants, 0 QuantifiedInterpolants, 1083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 5200/5200 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:25:38,537 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-1loop_file-9.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 cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:25:40,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:25:40,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:25:40,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:25:40,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:25:40,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:25:40,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:25:40,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:25:40,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:25:40,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:25:40,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:25:40,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:25:40,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:25:40,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:25:40,389 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:25:40,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:25:40,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:25:40,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:25:40,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:25:40,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:25:40,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:25:40,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:25:40,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:25:40,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:25:40,393 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:25:40,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:25:40,393 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:25:40,393 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:25:40,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:25:40,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:25:40,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:25:40,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:25:40,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:25:40,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:25:40,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:40,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:25:40,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:25:40,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:25:40,395 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:25:40,395 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:25:40,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:25:40,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:25:40,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:25:40,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:25:40,396 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 -> cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 [2024-11-08 23:25:40,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:25:40,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:25:40,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:25:40,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:25:40,673 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:25:40,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-11-08 23:25:41,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:25:42,137 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:25:42,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-11-08 23:25:42,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaae9f5b6/82540db420524f539b599297a0670242/FLAG1e8f973e1 [2024-11-08 23:25:42,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaae9f5b6/82540db420524f539b599297a0670242 [2024-11-08 23:25:42,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:25:42,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:25:42,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:42,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:25:42,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:25:42,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696ebf3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42, skipping insertion in model container [2024-11-08 23:25:42,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:25:42,347 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-1loop_file-9.i[915,928] [2024-11-08 23:25:42,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:42,454 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:25:42,466 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-1loop_file-9.i[915,928] [2024-11-08 23:25:42,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:42,507 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:25:42,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42 WrapperNode [2024-11-08 23:25:42,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:42,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:42,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:25:42,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:25:42,514 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:25:42" (1/1) ... [2024-11-08 23:25:42,525 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:25:42" (1/1) ... [2024-11-08 23:25:42,556 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-08 23:25:42,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:42,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:25:42,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:25:42,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:25:42,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,592 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:25:42,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:25:42,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:25:42,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:25:42,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:25:42,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (1/1) ... [2024-11-08 23:25:42,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:42,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:25:42,654 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:25:42,657 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:25:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:25:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:25:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:25:42,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:25:42,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:25:42,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:25:42,777 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:25:42,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:25:56,463 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:25:56,463 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:25:56,475 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:25:56,475 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:25:56,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:56 BoogieIcfgContainer [2024-11-08 23:25:56,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:25:56,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:25:56,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:25:56,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:25:56,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:25:42" (1/3) ... [2024-11-08 23:25:56,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5ce25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:56, skipping insertion in model container [2024-11-08 23:25:56,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:42" (2/3) ... [2024-11-08 23:25:56,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5ce25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:56, skipping insertion in model container [2024-11-08 23:25:56,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:56" (3/3) ... [2024-11-08 23:25:56,482 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-9.i [2024-11-08 23:25:56,495 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:25:56,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:25:56,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:25:56,542 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;@2d20d085, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:25:56,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:25:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:25:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:25:56,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:56,555 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:56,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:56,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1928837837, now seen corresponding path program 1 times [2024-11-08 23:25:56,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:25:56,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785660823] [2024-11-08 23:25:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:56,570 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:25:56,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:25:56,572 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:25:56,573 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:25:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:25:57,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:25:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-08 23:25:57,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:25:57,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:25:57,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785660823] [2024-11-08 23:25:57,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785660823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:57,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:57,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:25:57,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809108216] [2024-11-08 23:25:57,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:57,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:25:57,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:25:57,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:25:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:25:57,438 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:25:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:57,479 INFO L93 Difference]: Finished difference Result 170 states and 297 transitions. [2024-11-08 23:25:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:25:57,482 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2024-11-08 23:25:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:57,489 INFO L225 Difference]: With dead ends: 170 [2024-11-08 23:25:57,489 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 23:25:57,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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:25:57,496 INFO L432 NwaCegarLoop]: 129 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, 129 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:25:57,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 23:25:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 23:25:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:25:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-08 23:25:57,536 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 166 [2024-11-08 23:25:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:57,537 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-08 23:25:57,537 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:25:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-08 23:25:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:25:57,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:57,540 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:57,562 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:25:57,741 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:25:57,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:57,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:57,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1024535829, now seen corresponding path program 1 times [2024-11-08 23:25:57,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:25:57,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042180387] [2024-11-08 23:25:57,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:57,743 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:25:57,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:25:57,744 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:25:57,745 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:25:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:25:58,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:25:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:25:58,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:25:58,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:25:58,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042180387] [2024-11-08 23:25:58,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042180387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:58,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:58,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:25:58,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154093487] [2024-11-08 23:25:58,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:58,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:25:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:25:58,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:25:58,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:58,775 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:26:03,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:07,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:07,315 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2024-11-08 23:26:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:26:07,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-11-08 23:26:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:07,318 INFO L225 Difference]: With dead ends: 193 [2024-11-08 23:26:07,318 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 23:26:07,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:26:07,319 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 40 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:07,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 248 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-11-08 23:26:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 23:26:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2024-11-08 23:26:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.325) internal successors, (106), 81 states have internal predecessors, (106), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:26:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-11-08 23:26:07,334 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 166 [2024-11-08 23:26:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:07,337 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-11-08 23:26:07,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:26:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-11-08 23:26:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 23:26:07,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:07,339 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:07,365 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:26:07,540 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:26:07,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:07,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1665246138, now seen corresponding path program 1 times [2024-11-08 23:26:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:26:07,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66708355] [2024-11-08 23:26:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:07,542 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:26:07,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:26:07,543 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:26:07,544 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:26:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:08,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:26:08,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:26:12,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:26:12,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:26:12,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66708355] [2024-11-08 23:26:12,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66708355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:26:12,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:26:12,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:26:12,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704597483] [2024-11-08 23:26:12,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:26:12,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:26:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:26:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:26:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:26:12,011 INFO L87 Difference]: Start difference. First operand 111 states and 162 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:26:16,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:20,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:24,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:28,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:28,861 INFO L93 Difference]: Finished difference Result 321 states and 473 transitions. [2024-11-08 23:26:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:26:28,950 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-08 23:26:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:28,953 INFO L225 Difference]: With dead ends: 321 [2024-11-08 23:26:28,953 INFO L226 Difference]: Without dead ends: 213 [2024-11-08 23:26:28,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:26:28,955 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 85 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 53 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:28,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 358 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2024-11-08 23:26:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-08 23:26:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 159. [2024-11-08 23:26:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 101 states have (on average 1.2673267326732673) internal successors, (128), 102 states have internal predecessors, (128), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 23:26:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 236 transitions. [2024-11-08 23:26:28,994 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 236 transitions. Word has length 167 [2024-11-08 23:26:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:28,995 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 236 transitions. [2024-11-08 23:26:28,995 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:26:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 236 transitions. [2024-11-08 23:26:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:26:28,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:29,000 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:29,025 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 (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:26:29,200 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:26:29,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:29,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash 188348522, now seen corresponding path program 1 times [2024-11-08 23:26:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:26:29,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060599502] [2024-11-08 23:26:29,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:29,202 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:26:29,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:26:29,205 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:26:29,206 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:26:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:29,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:26:29,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:26:33,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:26:33,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:26:33,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060599502] [2024-11-08 23:26:33,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060599502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:26:33,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:26:33,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:26:33,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391254432] [2024-11-08 23:26:33,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:26:33,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:26:33,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:26:33,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:26:33,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:26:33,339 INFO L87 Difference]: Start difference. First operand 159 states and 236 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:26:37,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:41,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:41,655 INFO L93 Difference]: Finished difference Result 375 states and 554 transitions. [2024-11-08 23:26:41,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:26:41,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-08 23:26:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:41,741 INFO L225 Difference]: With dead ends: 375 [2024-11-08 23:26:41,741 INFO L226 Difference]: Without dead ends: 267 [2024-11-08 23:26:41,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:26:41,742 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 42 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:41,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 239 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-08 23:26:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-08 23:26:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2024-11-08 23:26:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 177 states have (on average 1.2768361581920904) internal successors, (226), 179 states have internal predecessors, (226), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-08 23:26:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 390 transitions. [2024-11-08 23:26:41,774 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 390 transitions. Word has length 168 [2024-11-08 23:26:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:41,774 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 390 transitions. [2024-11-08 23:26:41,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:26:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 390 transitions. [2024-11-08 23:26:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 23:26:41,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:41,776 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:41,801 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 (5)] Ended with exit code 0 [2024-11-08 23:26:41,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:26:41,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:41,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash 552036187, now seen corresponding path program 1 times [2024-11-08 23:26:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:26:41,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389143724] [2024-11-08 23:26:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:41,982 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:26:41,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:26:41,983 INFO L229 MonitoredProcess]: Starting monitored process 6 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:26:41,983 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 (6)] Waiting until timeout for monitored process [2024-11-08 23:26:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:42,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-08 23:26:42,999 INFO L278 TraceCheckSpWp]: Computing forward predicates...