./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.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_operatoramount_amount100_file-66.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 b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:27:29,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:27:29,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:27:29,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:27:29,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:27:29,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:27:29,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:27:29,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:27:29,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:27:29,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:27:29,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:27:29,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:27:29,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:27:29,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:27:29,849 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:27:29,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:27:29,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:27:29,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:27:29,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:27:29,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:27:29,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:27:29,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:27:29,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:27:29,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:27:29,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:27:29,866 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:27:29,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:27:29,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:27:29,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:27:29,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:27:29,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:27:29,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:27:29,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:29,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:27:29,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:27:29,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:27:29,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:27:29,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:27:29,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:27:29,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:27:29,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:27:29,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:27:29,877 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 -> b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb [2024-11-09 00:27:30,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:27:30,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:27:30,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:27:30,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:27:30,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:27:30,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2024-11-09 00:27:32,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:27:32,508 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:27:32,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2024-11-09 00:27:32,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1803b2313/1413a062e3004e22a21d66c38ee926aa/FLAGfa7b95a10 [2024-11-09 00:27:32,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1803b2313/1413a062e3004e22a21d66c38ee926aa [2024-11-09 00:27:32,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:27:32,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:27:32,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:32,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:27:32,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:27:32,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:32" (1/1) ... [2024-11-09 00:27:32,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9806e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:32, skipping insertion in model container [2024-11-09 00:27:32,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:32" (1/1) ... [2024-11-09 00:27:32,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:27:33,070 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_operatoramount_amount100_file-66.i[916,929] [2024-11-09 00:27:33,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:33,267 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:27:33,289 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_operatoramount_amount100_file-66.i[916,929] [2024-11-09 00:27:33,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:33,407 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:27:33,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33 WrapperNode [2024-11-09 00:27:33,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:33,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:33,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:27:33,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:27:33,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,484 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-09 00:27:33,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:33,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:27:33,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:27:33,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:27:33,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,551 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-09 00:27:33,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:27:33,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:27:33,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:27:33,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:27:33,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (1/1) ... [2024-11-09 00:27:33,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:33,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:33,631 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-09 00:27:33,635 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-09 00:27:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:27:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:27:33,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:27:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:27:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:27:33,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:27:33,807 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:27:33,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:27:34,268 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-09 00:27:34,268 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:27:34,284 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:27:34,284 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:27:34,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:34 BoogieIcfgContainer [2024-11-09 00:27:34,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:27:34,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:27:34,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:27:34,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:27:34,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:27:32" (1/3) ... [2024-11-09 00:27:34,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263f4c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:34, skipping insertion in model container [2024-11-09 00:27:34,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:33" (2/3) ... [2024-11-09 00:27:34,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263f4c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:34, skipping insertion in model container [2024-11-09 00:27:34,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:34" (3/3) ... [2024-11-09 00:27:34,295 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-66.i [2024-11-09 00:27:34,314 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:27:34,315 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:27:34,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:27:34,394 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;@63723a72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:27:34,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:27:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:27:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:27:34,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:34,414 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:34,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:34,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash -489925140, now seen corresponding path program 1 times [2024-11-09 00:27:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:34,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928738266] [2024-11-09 00:27:34,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:27:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:27:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:27:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:27:35,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:35,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928738266] [2024-11-09 00:27:35,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928738266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:35,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:35,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:27:35,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927437854] [2024-11-09 00:27:35,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:35,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:27:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:35,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:27:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:27:35,314 INFO L87 Difference]: Start difference. First operand has 90 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:27:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:35,384 INFO L93 Difference]: Finished difference Result 212 states and 356 transitions. [2024-11-09 00:27:35,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:27:35,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2024-11-09 00:27:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:35,406 INFO L225 Difference]: With dead ends: 212 [2024-11-09 00:27:35,407 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 00:27:35,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-09 00:27:35,415 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 57 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:35,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 305 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:27:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 00:27:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2024-11-09 00:27:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:27:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2024-11-09 00:27:35,484 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 149 [2024-11-09 00:27:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:35,490 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2024-11-09 00:27:35,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:27:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2024-11-09 00:27:35,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:27:35,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:35,499 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:35,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:27:35,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:35,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash -623938646, now seen corresponding path program 1 times [2024-11-09 00:27:35,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:35,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407930835] [2024-11-09 00:27:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:27:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:27:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:27:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 00:27:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407930835] [2024-11-09 00:27:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407930835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:27:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843551940] [2024-11-09 00:27:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:36,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:36,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:36,670 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-09 00:27:36,685 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-09 00:27:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:36,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 00:27:36,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:27:37,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:27:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 00:27:38,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843551940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:27:38,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:27:38,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2024-11-09 00:27:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867333133] [2024-11-09 00:27:38,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:27:38,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 00:27:38,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:38,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 00:27:38,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:27:38,192 INFO L87 Difference]: Start difference. First operand 88 states and 133 transitions. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-09 00:27:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:39,635 INFO L93 Difference]: Finished difference Result 446 states and 662 transitions. [2024-11-09 00:27:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 00:27:39,636 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 6 states have call successors, (63) Word has length 149 [2024-11-09 00:27:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:39,640 INFO L225 Difference]: With dead ends: 446 [2024-11-09 00:27:39,640 INFO L226 Difference]: Without dead ends: 361 [2024-11-09 00:27:39,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 00:27:39,643 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 597 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:39,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 843 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 00:27:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-09 00:27:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 273. [2024-11-09 00:27:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 63 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-09 00:27:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 400 transitions. [2024-11-09 00:27:39,695 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 400 transitions. Word has length 149 [2024-11-09 00:27:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:39,696 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 400 transitions. [2024-11-09 00:27:39,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-09 00:27:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 400 transitions. [2024-11-09 00:27:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:27:39,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:39,699 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:39,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:27:39,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:39,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:39,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash 393737006, now seen corresponding path program 1 times [2024-11-09 00:27:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:39,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213466877] [2024-11-09 00:27:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:39,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:27:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:27:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:27:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:27:40,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213466877] [2024-11-09 00:27:40,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213466877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:40,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:40,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:27:40,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303993194] [2024-11-09 00:27:40,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:40,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:27:40,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:40,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:27:40,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:27:40,297 INFO L87 Difference]: Start difference. First operand 273 states and 400 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:27:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:40,352 INFO L93 Difference]: Finished difference Result 543 states and 797 transitions. [2024-11-09 00:27:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:27:40,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2024-11-09 00:27:40,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:40,356 INFO L225 Difference]: With dead ends: 543 [2024-11-09 00:27:40,356 INFO L226 Difference]: Without dead ends: 273 [2024-11-09 00:27:40,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-09 00:27:40,365 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:40,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 119 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:27:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-09 00:27:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-09 00:27:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 201 states have (on average 1.318407960199005) internal successors, (265), 201 states have internal predecessors, (265), 63 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-09 00:27:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 391 transitions. [2024-11-09 00:27:40,418 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 391 transitions. Word has length 149 [2024-11-09 00:27:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:40,420 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 391 transitions. [2024-11-09 00:27:40,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:27:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 391 transitions. [2024-11-09 00:27:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:27:40,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:40,428 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:40,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:27:40,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:40,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash -193069008, now seen corresponding path program 1 times [2024-11-09 00:27:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770772999] [2024-11-09 00:27:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:40,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:27:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:27:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:27:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:27:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:41,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770772999] [2024-11-09 00:27:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770772999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:27:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678783006] [2024-11-09 00:27:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:41,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:27:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:41,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:27:41,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:41,045 INFO L87 Difference]: Start difference. First operand 273 states and 391 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:27:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:41,137 INFO L93 Difference]: Finished difference Result 543 states and 779 transitions. [2024-11-09 00:27:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:27:41,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2024-11-09 00:27:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:41,146 INFO L225 Difference]: With dead ends: 543 [2024-11-09 00:27:41,146 INFO L226 Difference]: Without dead ends: 273 [2024-11-09 00:27:41,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-09 00:27:41,153 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 69 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:41,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 233 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:27:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-09 00:27:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-09 00:27:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 201 states have (on average 1.3034825870646767) internal successors, (262), 201 states have internal predecessors, (262), 63 states have call successors, (63), 8 states have call predecessors, (63), 8 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-09 00:27:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 388 transitions. [2024-11-09 00:27:41,228 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 388 transitions. Word has length 149 [2024-11-09 00:27:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:41,230 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 388 transitions. [2024-11-09 00:27:41,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:27:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 388 transitions. [2024-11-09 00:27:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 00:27:41,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:41,232 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:41,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:27:41,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:41,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1669324217, now seen corresponding path program 1 times [2024-11-09 00:27:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:41,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091694853] [2024-11-09 00:27:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:27:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:27:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:27:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 00:27:41,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:41,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091694853] [2024-11-09 00:27:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091694853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:27:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222048402] [2024-11-09 00:27:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:41,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:41,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:27:41,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:27:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:42,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 00:27:42,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 284 proven. 48 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-09 00:27:42,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:27:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 00:27:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222048402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:27:42,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:27:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 18 [2024-11-09 00:27:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102115265] [2024-11-09 00:27:42,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:27:42,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 00:27:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:42,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 00:27:42,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-09 00:27:42,739 INFO L87 Difference]: Start difference. First operand 273 states and 388 transitions. Second operand has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-09 00:27:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:45,090 INFO L93 Difference]: Finished difference Result 2029 states and 2755 transitions. [2024-11-09 00:27:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-09 00:27:45,091 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 151 [2024-11-09 00:27:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:45,101 INFO L225 Difference]: With dead ends: 2029 [2024-11-09 00:27:45,102 INFO L226 Difference]: Without dead ends: 1759 [2024-11-09 00:27:45,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2111 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1273, Invalid=4889, Unknown=0, NotChecked=0, Total=6162 [2024-11-09 00:27:45,106 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 1507 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:45,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1249 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 00:27:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-11-09 00:27:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1319. [2024-11-09 00:27:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 992 states have (on average 1.2389112903225807) internal successors, (1229), 1001 states have internal predecessors, (1229), 264 states have call successors, (264), 62 states have call predecessors, (264), 62 states have return successors, (264), 255 states have call predecessors, (264), 264 states have call successors, (264) [2024-11-09 00:27:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1757 transitions. [2024-11-09 00:27:45,330 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1757 transitions. Word has length 151 [2024-11-09 00:27:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:45,332 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1757 transitions. [2024-11-09 00:27:45,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-09 00:27:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1757 transitions. [2024-11-09 00:27:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:27:45,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:45,335 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:45,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:27:45,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:45,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:45,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1164481915, now seen corresponding path program 1 times [2024-11-09 00:27:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:45,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765188250] [2024-11-09 00:27:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:27:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:27:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:27:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:27:45,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:45,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765188250] [2024-11-09 00:27:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765188250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:45,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:45,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:27:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683567422] [2024-11-09 00:27:45,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:45,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:27:45,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:45,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:27:45,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:27:45,803 INFO L87 Difference]: Start difference. First operand 1319 states and 1757 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:27:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:46,308 INFO L93 Difference]: Finished difference Result 4543 states and 6031 transitions. [2024-11-09 00:27:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:27:46,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 152 [2024-11-09 00:27:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:46,329 INFO L225 Difference]: With dead ends: 4543 [2024-11-09 00:27:46,329 INFO L226 Difference]: Without dead ends: 3227 [2024-11-09 00:27:46,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:27:46,337 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 376 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:46,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 736 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:27:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2024-11-09 00:27:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2329. [2024-11-09 00:27:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 1753 states have (on average 1.221905305191101) internal successors, (2142), 1771 states have internal predecessors, (2142), 465 states have call successors, (465), 110 states have call predecessors, (465), 110 states have return successors, (465), 447 states have call predecessors, (465), 465 states have call successors, (465) [2024-11-09 00:27:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3072 transitions. [2024-11-09 00:27:46,669 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3072 transitions. Word has length 152 [2024-11-09 00:27:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:46,669 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 3072 transitions. [2024-11-09 00:27:46,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:27:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3072 transitions. [2024-11-09 00:27:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:27:46,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:46,676 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:46,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:27:46,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:46,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1358146856, now seen corresponding path program 1 times [2024-11-09 00:27:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385656661] [2024-11-09 00:27:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:27:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68571462] [2024-11-09 00:27:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:46,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:46,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:46,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:27:46,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:27:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:27:46,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:27:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:27:47,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:27:47,171 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:27:47,173 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:27:47,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 00:27:47,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:47,384 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:27:47,495 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:27:47,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:27:47 BoogieIcfgContainer [2024-11-09 00:27:47,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:27:47,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:27:47,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:27:47,500 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:27:47,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:34" (3/4) ... [2024-11-09 00:27:47,502 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:27:47,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:27:47,504 INFO L158 Benchmark]: Toolchain (without parser) took 14671.11ms. Allocated memory was 172.0MB in the beginning and 411.0MB in the end (delta: 239.1MB). Free memory was 99.1MB in the beginning and 286.6MB in the end (delta: -187.5MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-11-09 00:27:47,505 INFO L158 Benchmark]: CDTParser took 3.88ms. Allocated memory is still 172.0MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:27:47,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.92ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 98.9MB in the beginning and 225.0MB in the end (delta: -126.1MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-11-09 00:27:47,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.13ms. Allocated memory is still 255.9MB. Free memory was 225.0MB in the beginning and 220.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:27:47,505 INFO L158 Benchmark]: Boogie Preprocessor took 108.59ms. Allocated memory is still 255.9MB. Free memory was 220.5MB in the beginning and 213.5MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:27:47,506 INFO L158 Benchmark]: RCFGBuilder took 690.24ms. Allocated memory is still 255.9MB. Free memory was 213.5MB in the beginning and 184.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 00:27:47,506 INFO L158 Benchmark]: TraceAbstraction took 13211.33ms. Allocated memory was 255.9MB in the beginning and 411.0MB in the end (delta: 155.2MB). Free memory was 183.0MB in the beginning and 287.6MB in the end (delta: -104.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2024-11-09 00:27:47,506 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 411.0MB. Free memory was 287.6MB in the beginning and 286.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:27:47,508 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.88ms. Allocated memory is still 172.0MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.92ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 98.9MB in the beginning and 225.0MB in the end (delta: -126.1MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.13ms. Allocated memory is still 255.9MB. Free memory was 225.0MB in the beginning and 220.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.59ms. Allocated memory is still 255.9MB. Free memory was 220.5MB in the beginning and 213.5MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 690.24ms. Allocated memory is still 255.9MB. Free memory was 213.5MB in the beginning and 184.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13211.33ms. Allocated memory was 255.9MB in the beginning and 411.0MB in the end (delta: 155.2MB). Free memory was 183.0MB in the beginning and 287.6MB in the end (delta: -104.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 411.0MB. Free memory was 287.6MB in the beginning and 286.6MB in the end (delta: 1.0MB). 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 someBinaryFLOATComparisonOperation at line 197, overapproximation of shiftLeft at line 144, overapproximation of someBinaryArithmeticDOUBLEoperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 197. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned short int var_1_5 = 63575; [L24] unsigned long int var_1_6 = 10; [L25] unsigned long int var_1_8 = 3366149252; [L26] signed long int var_1_9 = -10; [L27] signed long int var_1_11 = 1938698816; [L28] unsigned char var_1_12 = 5; [L29] unsigned char var_1_13 = 64; [L30] unsigned char var_1_14 = 64; [L31] double var_1_15 = 99.625; [L32] double var_1_16 = 0.0; [L33] double var_1_17 = 999.5; [L34] double var_1_18 = 9.35; [L35] float var_1_19 = 99.875; [L36] float var_1_20 = 10000.71; [L37] double var_1_21 = 1000.5; [L38] double var_1_23 = 15.25; [L39] signed long int var_1_24 = 8; [L40] unsigned short int var_1_25 = 32; [L41] signed short int var_1_26 = 2; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_32 = 0; [L47] float var_1_33 = 64.75; [L48] float var_1_34 = 9.2; [L49] unsigned short int last_1_var_1_1 = 64; [L50] signed long int last_1_var_1_9 = -10; [L51] unsigned char last_1_var_1_12 = 5; [L52] signed long int last_1_var_1_24 = 8; [L53] unsigned short int last_1_var_1_25 = 32; [L54] unsigned char last_1_var_1_27 = 0; [L55] unsigned char last_1_var_1_29 = 0; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=63575, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_9 = var_1_9 [L190] last_1_var_1_12 = var_1_12 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_25 = var_1_25 [L193] last_1_var_1_27 = var_1_27 [L194] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=63575, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L152] var_1_5 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L153] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L155] var_1_8 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_8 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L156] RET assume_abort_if_not(var_1_8 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L157] CALL assume_abort_if_not(var_1_8 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L157] RET assume_abort_if_not(var_1_8 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L158] var_1_11 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_11 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L159] RET assume_abort_if_not(var_1_11 >= 1073741822) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L160] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L160] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L161] var_1_13 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L162] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L163] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L163] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L164] var_1_14 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L165] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L166] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L166] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L167] var_1_16 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L168] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L169] var_1_17 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L170] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L171] var_1_18 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L172] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L173] var_1_20 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L174] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L175] var_1_28 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L176] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L177] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L177] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L178] var_1_30 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L179] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L180] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L180] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L181] var_1_32 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L182] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L183] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L183] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L184] var_1_34 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L185] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L205] RET updateVariables() [L206] CALL step() [L59] signed long int stepLocal_8 = 10000000; [L60] unsigned long int stepLocal_7 = 128u + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_7=192, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L61] COND FALSE !(last_1_var_1_24 >= stepLocal_7) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L66] COND FALSE !(last_1_var_1_12 >= last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L71] COND FALSE !(\read(last_1_var_1_29)) [L74] var_1_12 = (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L76] COND FALSE !(\read(last_1_var_1_29)) [L83] var_1_9 = ((var_1_11 - 16) - last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L85] unsigned char stepLocal_4 = var_1_14; [L86] unsigned char stepLocal_3 = last_1_var_1_27; [L87] unsigned char stepLocal_2 = last_1_var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_4=63, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L88] COND TRUE (var_1_13 * (var_1_5 * last_1_var_1_9)) <= stepLocal_4 [L89] var_1_24 = 50 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L99] var_1_15 = ((var_1_16 - var_1_17) - var_1_18) [L100] unsigned long int stepLocal_9 = 50u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, stepLocal_9=50, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L101] COND FALSE !(stepLocal_9 >= var_1_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L104] unsigned char stepLocal_12 = var_1_26 > var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_12=0, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L105] COND FALSE !(var_1_32 || stepLocal_12) [L108] var_1_33 = var_1_16 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L110] signed short int stepLocal_1 = var_1_26; [L111] signed long int stepLocal_0 = var_1_24; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_1=2, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L112] COND FALSE !(stepLocal_1 >= (var_1_26 + (var_1_14 * 16))) [L117] var_1_21 = (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L119] COND TRUE var_1_33 >= 0.25 [L120] var_1_19 = (var_1_17 + var_1_20) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L122] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=10, var_1_8=-2147483649, var_1_9=1073741798] [L125] COND TRUE (var_1_33 * 8.2) < 10.4 [L126] var_1_6 = (var_1_8 - var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L128] signed long int stepLocal_6 = 0; [L129] unsigned long int stepLocal_5 = 25u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_6=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L130] COND FALSE !(stepLocal_6 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L135] COND FALSE !(var_1_8 < stepLocal_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L139] signed long int stepLocal_11 = (((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14)); [L140] unsigned char stepLocal_10 = var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_10=0, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L141] COND FALSE !(var_1_28 && stepLocal_10) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L144] EXPR -25 << var_1_9 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L144] COND TRUE stepLocal_11 > (-25 << var_1_9) [L145] var_1_29 = (var_1_27 || var_1_28) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR (((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32))))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L197-L198] return ((((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32)))))) && ((var_1_32 || (var_1_26 > var_1_1)) ? (var_1_33 == ((float) (((((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) < (var_1_16)) ? ((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) : (var_1_16))))) : (var_1_33 == ((float) var_1_16))) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=-32769, var_1_6=-3221225447, var_1_8=-2147483649, var_1_9=1073741798] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2684 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2681 mSDsluCounter, 3485 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2487 mSDsCounter, 788 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1855 IncrementalHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 788 mSolverCounterUnsat, 998 mSDtfsCounter, 1855 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 983 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2616 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2329occurred in iteration=6, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 6 MinimizatonAttempts, 1463 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1503 NumberOfCodeBlocks, 1503 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 4400 SizeOfPredicates, 9 NumberOfNonLiveVariables, 778 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 8184/8400 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-09 00:27:47,540 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_operatoramount_amount100_file-66.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 b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:27:50,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:27:50,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:27:50,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:27:50,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:27:50,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:27:50,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:27:50,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:27:50,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:27:50,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:27:50,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:27:50,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:27:50,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:27:50,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:27:50,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:27:50,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:27:50,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:27:50,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:27:50,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:27:50,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:27:50,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:27:50,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:27:50,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:27:50,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:27:50,465 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:27:50,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:27:50,465 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:27:50,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:27:50,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:27:50,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:27:50,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:27:50,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:27:50,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:27:50,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:27:50,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:50,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:27:50,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:27:50,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:27:50,472 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:27:50,473 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:27:50,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:27:50,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:27:50,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:27:50,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:27:50,475 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 -> b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb [2024-11-09 00:27:50,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:27:50,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:27:50,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:27:50,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:27:50,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:27:50,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2024-11-09 00:27:52,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:27:53,135 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:27:53,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2024-11-09 00:27:53,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b59b64c/6da3a15099204783a2c418e0100490b2/FLAG973e6afa3 [2024-11-09 00:27:53,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b59b64c/6da3a15099204783a2c418e0100490b2 [2024-11-09 00:27:53,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:27:53,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:27:53,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:53,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:27:53,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:27:53,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:53" (1/1) ... [2024-11-09 00:27:53,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f5652c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:53, skipping insertion in model container [2024-11-09 00:27:53,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:53" (1/1) ... [2024-11-09 00:27:53,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:27:53,770 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_operatoramount_amount100_file-66.i[916,929] [2024-11-09 00:27:53,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:53,916 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:27:53,931 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_operatoramount_amount100_file-66.i[916,929] [2024-11-09 00:27:53,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:54,028 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:27:54,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54 WrapperNode [2024-11-09 00:27:54,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:54,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:54,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:27:54,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:27:54,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,125 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-09 00:27:54,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:54,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:27:54,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:27:54,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:27:54,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,185 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-09 00:27:54,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:27:54,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:27:54,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:27:54,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:27:54,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:54,289 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-09 00:27:54,304 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-09 00:27:54,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:27:54,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:27:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:27:54,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:27:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:27:54,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:27:54,504 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:27:54,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:28:10,038 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-09 00:28:10,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:28:10,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:28:10,056 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:28:10,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:28:10 BoogieIcfgContainer [2024-11-09 00:28:10,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:28:10,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:28:10,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:28:10,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:28:10,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:27:53" (1/3) ... [2024-11-09 00:28:10,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39881403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:28:10, skipping insertion in model container [2024-11-09 00:28:10,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (2/3) ... [2024-11-09 00:28:10,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39881403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:28:10, skipping insertion in model container [2024-11-09 00:28:10,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:28:10" (3/3) ... [2024-11-09 00:28:10,068 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-66.i [2024-11-09 00:28:10,086 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:28:10,086 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:28:10,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:28:10,173 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;@7eb2cbe1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:28:10,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:28:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:28:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 00:28:10,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:10,196 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:10,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:10,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1080973051, now seen corresponding path program 1 times [2024-11-09 00:28:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:28:10,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660669689] [2024-11-09 00:28:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:10,220 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-09 00:28:10,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:28:10,223 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-09 00:28:10,225 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-09 00:28:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:11,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:28:11,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:28:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-09 00:28:11,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:28:11,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:28:11,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660669689] [2024-11-09 00:28:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660669689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:28:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:28:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:28:11,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036734072] [2024-11-09 00:28:11,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:28:11,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:28:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:28:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:28:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:28:11,387 INFO L87 Difference]: Start difference. First operand has 81 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:28:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:11,419 INFO L93 Difference]: Finished difference Result 155 states and 267 transitions. [2024-11-09 00:28:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:28:11,422 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 147 [2024-11-09 00:28:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:11,429 INFO L225 Difference]: With dead ends: 155 [2024-11-09 00:28:11,430 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 00:28:11,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-09 00:28:11,439 INFO L432 NwaCegarLoop]: 119 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, 119 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-09 00:28:11,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:28:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 00:28:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 00:28:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:28:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2024-11-09 00:28:11,489 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 147 [2024-11-09 00:28:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:11,490 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2024-11-09 00:28:11,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:28:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2024-11-09 00:28:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 00:28:11,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:11,493 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:11,528 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-09 00:28:11,694 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-09 00:28:11,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:11,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1163602625, now seen corresponding path program 1 times [2024-11-09 00:28:11,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:28:11,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603573695] [2024-11-09 00:28:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:11,697 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-09 00:28:11,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:28:11,702 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-09 00:28:11,704 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-09 00:28:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:12,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 00:28:12,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:28:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:28:16,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:28:16,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:28:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603573695] [2024-11-09 00:28:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603573695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:28:16,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:28:16,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:28:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42139824] [2024-11-09 00:28:16,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:28:16,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:28:16,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:28:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:28:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:28:16,387 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:28:21,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:25,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:29,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:33,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:33,719 INFO L93 Difference]: Finished difference Result 248 states and 390 transitions. [2024-11-09 00:28:33,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:28:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 147 [2024-11-09 00:28:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:33,896 INFO L225 Difference]: With dead ends: 248 [2024-11-09 00:28:33,897 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 00:28:33,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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-09 00:28:33,915 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 147 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:28:33,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 332 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 17.2s Time] [2024-11-09 00:28:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 00:28:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2024-11-09 00:28:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 00:28:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 188 transitions. [2024-11-09 00:28:33,987 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 188 transitions. Word has length 147 [2024-11-09 00:28:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:33,990 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 188 transitions. [2024-11-09 00:28:33,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:28:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 188 transitions. [2024-11-09 00:28:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 00:28:33,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:33,996 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:34,037 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-09 00:28:34,200 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-09 00:28:34,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:34,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1382457343, now seen corresponding path program 1 times [2024-11-09 00:28:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:28:34,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986019850] [2024-11-09 00:28:34,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:34,211 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-09 00:28:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:28:34,216 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-09 00:28:34,220 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-09 00:28:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:35,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 00:28:35,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:28:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:28:46,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:28:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 00:28:51,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:28:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986019850] [2024-11-09 00:28:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986019850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:28:51,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:28:51,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2024-11-09 00:28:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223837181] [2024-11-09 00:28:51,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:28:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 00:28:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:28:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 00:28:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:28:51,577 INFO L87 Difference]: Start difference. First operand 123 states and 188 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-09 00:28:59,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []