./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.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 8eeb14fc4af4141dc041f376e493f1f94c8be383db2e49ff3554ffa1b21cacd5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:15:19,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:15:19,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:15:19,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:15:19,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:15:19,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:15:19,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:15:19,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:15:19,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:15:19,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:15:19,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:15:19,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:15:19,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:15:19,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:15:19,384 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:15:19,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:15:19,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:15:19,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:15:19,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:15:19,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:15:19,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:15:19,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:15:19,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:15:19,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:15:19,391 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:15:19,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:15:19,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:15:19,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:15:19,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:15:19,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:15:19,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:15:19,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:15:19,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:15:19,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:15:19,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:15:19,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:15:19,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:15:19,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:15:19,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:15:19,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:15:19,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:15:19,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:15:19,395 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 -> 8eeb14fc4af4141dc041f376e493f1f94c8be383db2e49ff3554ffa1b21cacd5 [2024-10-14 08:15:19,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:15:19,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:15:19,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:15:19,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:15:19,636 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:15:19,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-14 08:15:21,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:15:21,241 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:15:21,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-14 08:15:21,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609b701c8/06ff8f364338432983ceaac994e5eb9d/FLAGbc73126cf [2024-10-14 08:15:21,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609b701c8/06ff8f364338432983ceaac994e5eb9d [2024-10-14 08:15:21,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:15:21,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:15:21,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:15:21,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:15:21,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:15:21,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb3981e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21, skipping insertion in model container [2024-10-14 08:15:21,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:15:21,447 WARN L248 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_fillercode_fillercodesize_ps-cn-10_file-53.i[915,928] [2024-10-14 08:15:21,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:15:21,603 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:15:21,617 WARN L248 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_fillercode_fillercodesize_ps-cn-10_file-53.i[915,928] [2024-10-14 08:15:21,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:15:21,666 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:15:21,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21 WrapperNode [2024-10-14 08:15:21,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:15:21,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:15:21,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:15:21,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:15:21,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,726 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 228 [2024-10-14 08:15:21,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:15:21,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:15:21,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:15:21,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:15:21,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,783 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-10-14 08:15:21,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:15:21,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:15:21,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:15:21,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:15:21,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (1/1) ... [2024-10-14 08:15:21,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:15:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:15:21,862 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-10-14 08:15:21,865 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-10-14 08:15:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:15:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:15:21,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:15:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:15:21,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:15:21,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:15:21,990 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:15:21,993 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:15:22,418 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-14 08:15:22,419 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:15:22,465 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:15:22,466 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:15:22,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:15:22 BoogieIcfgContainer [2024-10-14 08:15:22,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:15:22,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:15:22,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:15:22,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:15:22,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:15:21" (1/3) ... [2024-10-14 08:15:22,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363583a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:15:22, skipping insertion in model container [2024-10-14 08:15:22,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:21" (2/3) ... [2024-10-14 08:15:22,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363583a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:15:22, skipping insertion in model container [2024-10-14 08:15:22,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:15:22" (3/3) ... [2024-10-14 08:15:22,482 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-14 08:15:22,503 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:15:22,503 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:15:22,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:15:22,570 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;@1a860c04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:15:22,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:15:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:15:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 08:15:22,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:22,588 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:22,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1041261698, now seen corresponding path program 1 times [2024-10-14 08:15:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:15:22,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367225935] [2024-10-14 08:15:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:15:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:15:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:15:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:15:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:15:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:15:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:15:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:15:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:15:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:15:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:15:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:15:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:15:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:15:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:15:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:15:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:15:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:15:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:15:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:15:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:15:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:15:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:15:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:15:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:15:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:22,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:15:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:15:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:15:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:15:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:23,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:15:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367225935] [2024-10-14 08:15:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367225935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:15:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69596858] [2024-10-14 08:15:23,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:23,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:15:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:15:23,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:15:23,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:15:23,084 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 08:15:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:23,133 INFO L93 Difference]: Finished difference Result 175 states and 304 transitions. [2024-10-14 08:15:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:15:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2024-10-14 08:15:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:23,148 INFO L225 Difference]: With dead ends: 175 [2024-10-14 08:15:23,148 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 08:15:23,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-10-14 08:15:23,159 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:23,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:15:23,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 08:15:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 08:15:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:15:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-10-14 08:15:23,230 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 175 [2024-10-14 08:15:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:23,230 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-10-14 08:15:23,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 08:15:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-10-14 08:15:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 08:15:23,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:23,237 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:23,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:15:23,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:23,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:23,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1166707974, now seen corresponding path program 1 times [2024-10-14 08:15:23,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:15:23,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652671189] [2024-10-14 08:15:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:15:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:15:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:15:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:15:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:15:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:15:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:15:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:15:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:15:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:15:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:15:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:15:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:15:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:15:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:15:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:15:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:15:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:15:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:15:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:15:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:15:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:15:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:15:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:15:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:15:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:15:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:15:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:15:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:15:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:23,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:15:23,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652671189] [2024-10-14 08:15:23,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652671189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:23,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:23,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:15:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336237217] [2024-10-14 08:15:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:23,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:15:23,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:15:23,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:15:23,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:15:23,544 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:23,649 INFO L93 Difference]: Finished difference Result 250 states and 385 transitions. [2024-10-14 08:15:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:15:23,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2024-10-14 08:15:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:23,652 INFO L225 Difference]: With dead ends: 250 [2024-10-14 08:15:23,652 INFO L226 Difference]: Without dead ends: 164 [2024-10-14 08:15:23,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-10-14 08:15:23,654 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 113 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:23,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 337 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 08:15:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-14 08:15:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-10-14 08:15:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 08:15:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 248 transitions. [2024-10-14 08:15:23,685 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 248 transitions. Word has length 175 [2024-10-14 08:15:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:23,686 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 248 transitions. [2024-10-14 08:15:23,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 248 transitions. [2024-10-14 08:15:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-14 08:15:23,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:23,688 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:23,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:15:23,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:23,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash -332924040, now seen corresponding path program 1 times [2024-10-14 08:15:23,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:15:23,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073139004] [2024-10-14 08:15:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:23,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:15:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:15:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:23,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:15:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:15:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:15:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:15:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:15:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:15:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:15:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:15:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:15:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:15:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:15:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:15:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:15:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:15:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:15:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:15:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:15:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:15:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:15:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:15:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:15:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:15:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:15:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:15:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:15:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:15:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:15:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:15:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073139004] [2024-10-14 08:15:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073139004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:24,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:15:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065336995] [2024-10-14 08:15:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:24,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:15:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:15:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:15:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:15:24,100 INFO L87 Difference]: Start difference. First operand 162 states and 248 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:24,331 INFO L93 Difference]: Finished difference Result 535 states and 813 transitions. [2024-10-14 08:15:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:15:24,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-14 08:15:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:24,339 INFO L225 Difference]: With dead ends: 535 [2024-10-14 08:15:24,339 INFO L226 Difference]: Without dead ends: 374 [2024-10-14 08:15:24,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-10-14 08:15:24,341 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 173 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:24,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 345 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:15:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-14 08:15:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 358. [2024-10-14 08:15:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 241 states have (on average 1.3278008298755186) internal successors, (320), 241 states have internal predecessors, (320), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-14 08:15:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 544 transitions. [2024-10-14 08:15:24,403 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 544 transitions. Word has length 176 [2024-10-14 08:15:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:24,404 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 544 transitions. [2024-10-14 08:15:24,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 544 transitions. [2024-10-14 08:15:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 08:15:24,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:24,411 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:24,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 08:15:24,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1197858128, now seen corresponding path program 1 times [2024-10-14 08:15:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:15:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975246104] [2024-10-14 08:15:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:15:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:15:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:15:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:15:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:15:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:15:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:15:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:15:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:15:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:15:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:15:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:15:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:15:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:15:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:15:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:15:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:15:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:15:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:15:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:15:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:15:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:15:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:15:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:15:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:15:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:15:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:15:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:15:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:15:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:24,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:15:24,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975246104] [2024-10-14 08:15:24,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975246104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:24,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:24,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:15:24,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693345941] [2024-10-14 08:15:24,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:24,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:15:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:15:24,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:15:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:15:24,647 INFO L87 Difference]: Start difference. First operand 358 states and 544 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:24,693 INFO L93 Difference]: Finished difference Result 905 states and 1380 transitions. [2024-10-14 08:15:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:15:24,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-14 08:15:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:24,697 INFO L225 Difference]: With dead ends: 905 [2024-10-14 08:15:24,697 INFO L226 Difference]: Without dead ends: 548 [2024-10-14 08:15:24,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-10-14 08:15:24,698 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 74 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:24,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 251 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:15:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-14 08:15:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2024-10-14 08:15:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 371 states have (on average 1.3234501347708896) internal successors, (491), 371 states have internal predecessors, (491), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-14 08:15:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 827 transitions. [2024-10-14 08:15:24,741 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 827 transitions. Word has length 177 [2024-10-14 08:15:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:24,742 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 827 transitions. [2024-10-14 08:15:24,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 827 transitions. [2024-10-14 08:15:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-14 08:15:24,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:24,744 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:24,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 08:15:24,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:24,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1078567188, now seen corresponding path program 1 times [2024-10-14 08:15:24,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:15:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669334766] [2024-10-14 08:15:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:15:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:15:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:15:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:15:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:15:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:15:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:15:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:15:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:15:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:15:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:15:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:15:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:15:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:15:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:15:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:15:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:15:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:15:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:15:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:15:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:15:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:15:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:15:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:15:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:15:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:15:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:15:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:15:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:15:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:24,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:15:24,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669334766] [2024-10-14 08:15:24,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669334766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:24,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:24,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:15:24,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602266652] [2024-10-14 08:15:24,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:24,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:15:24,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:15:24,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:15:24,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:15:24,842 INFO L87 Difference]: Start difference. First operand 546 states and 827 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:24,956 INFO L93 Difference]: Finished difference Result 1597 states and 2424 transitions. [2024-10-14 08:15:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:15:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-10-14 08:15:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:24,962 INFO L225 Difference]: With dead ends: 1597 [2024-10-14 08:15:24,962 INFO L226 Difference]: Without dead ends: 1052 [2024-10-14 08:15:24,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-10-14 08:15:24,965 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 127 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:24,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 349 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 08:15:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-10-14 08:15:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 558. [2024-10-14 08:15:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 383 states have (on average 1.3133159268929504) internal successors, (503), 383 states have internal predecessors, (503), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-14 08:15:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 839 transitions. [2024-10-14 08:15:25,051 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 839 transitions. Word has length 178 [2024-10-14 08:15:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:25,052 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 839 transitions. [2024-10-14 08:15:25,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 839 transitions. [2024-10-14 08:15:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-14 08:15:25,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:25,053 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:25,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 08:15:25,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:25,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash 685540178, now seen corresponding path program 1 times [2024-10-14 08:15:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:15:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301494269] [2024-10-14 08:15:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:15:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:15:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:15:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:15:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:15:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:15:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:15:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:15:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:15:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:15:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:15:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:15:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:15:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:15:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:15:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:15:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:15:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:15:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:15:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:15:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:15:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:15:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:15:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:15:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:15:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:15:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:15:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:15:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:15:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-14 08:15:25,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:15:25,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301494269] [2024-10-14 08:15:25,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301494269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 08:15:25,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736861472] [2024-10-14 08:15:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:25,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:15:25,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:15:25,384 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-10-14 08:15:25,385 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-10-14 08:15:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:25,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 08:15:25,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:15:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-10-14 08:15:26,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:15:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-14 08:15:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736861472] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 08:15:26,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 08:15:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 20 [2024-10-14 08:15:26,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870604674] [2024-10-14 08:15:26,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 08:15:26,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 08:15:26,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:15:26,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 08:15:26,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-10-14 08:15:26,553 INFO L87 Difference]: Start difference. First operand 558 states and 839 transitions. Second operand has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-14 08:15:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:28,740 INFO L93 Difference]: Finished difference Result 1828 states and 2685 transitions. [2024-10-14 08:15:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-14 08:15:28,741 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 178 [2024-10-14 08:15:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:28,748 INFO L225 Difference]: With dead ends: 1828 [2024-10-14 08:15:28,748 INFO L226 Difference]: Without dead ends: 1271 [2024-10-14 08:15:28,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 402 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=739, Invalid=2683, Unknown=0, NotChecked=0, Total=3422 [2024-10-14 08:15:28,752 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1102 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 752 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:28,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 1223 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [752 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 08:15:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-10-14 08:15:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 570. [2024-10-14 08:15:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 389 states have (on average 1.2930591259640103) internal successors, (503), 389 states have internal predecessors, (503), 168 states have call successors, (168), 12 states have call predecessors, (168), 12 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-14 08:15:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 839 transitions. [2024-10-14 08:15:28,840 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 839 transitions. Word has length 178 [2024-10-14 08:15:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:28,872 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 839 transitions. [2024-10-14 08:15:28,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-14 08:15:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 839 transitions. [2024-10-14 08:15:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-14 08:15:28,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:28,874 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:28,898 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-10-14 08:15:29,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 08:15:29,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:29,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1370107237, now seen corresponding path program 1 times [2024-10-14 08:15:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:15:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97338614] [2024-10-14 08:15:29,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:15:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:15:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:15:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:15:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:15:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:15:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:15:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:15:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:15:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:15:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:15:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:15:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:15:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:15:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:15:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:15:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:15:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:15:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:15:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:15:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:15:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:15:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:15:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:15:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:15:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:15:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:15:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:15:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:15:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:29,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:15:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97338614] [2024-10-14 08:15:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97338614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:15:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789451555] [2024-10-14 08:15:29,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:29,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:15:29,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:15:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:15:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:15:29,275 INFO L87 Difference]: Start difference. First operand 570 states and 839 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:29,383 INFO L93 Difference]: Finished difference Result 572 states and 840 transitions. [2024-10-14 08:15:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:15:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-10-14 08:15:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:29,385 INFO L225 Difference]: With dead ends: 572 [2024-10-14 08:15:29,385 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 08:15:29,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-10-14 08:15:29,387 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:29,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 08:15:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 08:15:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-14 08:15:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 08:15:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 286 transitions. [2024-10-14 08:15:29,411 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 286 transitions. Word has length 178 [2024-10-14 08:15:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:29,411 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 286 transitions. [2024-10-14 08:15:29,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 286 transitions. [2024-10-14 08:15:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 08:15:29,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:29,413 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:29,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 08:15:29,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:29,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash 551129246, now seen corresponding path program 1 times [2024-10-14 08:15:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:15:29,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298949922] [2024-10-14 08:15:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:15:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:15:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:15:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:15:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:15:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:15:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:15:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:15:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:15:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:15:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:15:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:15:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:15:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:15:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:15:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:15:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:15:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:15:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 08:15:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:15:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 08:15:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:15:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 08:15:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:15:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:15:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:15:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:15:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:15:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:15:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:29,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:15:29,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298949922] [2024-10-14 08:15:29,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298949922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:29,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:29,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:15:29,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771093752] [2024-10-14 08:15:29,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:29,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:15:29,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:15:29,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:15:29,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:15:29,592 INFO L87 Difference]: Start difference. First operand 199 states and 286 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:29,753 INFO L93 Difference]: Finished difference Result 399 states and 572 transitions. [2024-10-14 08:15:29,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:15:29,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-10-14 08:15:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:29,755 INFO L225 Difference]: With dead ends: 399 [2024-10-14 08:15:29,755 INFO L226 Difference]: Without dead ends: 201 [2024-10-14 08:15:29,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:15:29,756 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 64 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:29,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 262 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 08:15:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-14 08:15:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-10-14 08:15:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 138 states have internal predecessors, (173), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 08:15:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 285 transitions. [2024-10-14 08:15:29,779 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 285 transitions. Word has length 179 [2024-10-14 08:15:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:29,780 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 285 transitions. [2024-10-14 08:15:29,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 285 transitions. [2024-10-14 08:15:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 08:15:29,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:29,781 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:29,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 08:15:29,782 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:29,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash -258217380, now seen corresponding path program 1 times [2024-10-14 08:15:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:15:29,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435035900] [2024-10-14 08:15:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:29,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:15:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 08:15:29,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846509937] [2024-10-14 08:15:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:29,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:15:29,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:15:29,853 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-10-14 08:15:29,854 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-10-14 08:15:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:15:30,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 08:15:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:15:30,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 08:15:30,128 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 08:15:30,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 08:15:30,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 08:15:30,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-14 08:15:30,335 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:15:30,433 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 08:15:30,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:15:30 BoogieIcfgContainer [2024-10-14 08:15:30,436 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 08:15:30,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 08:15:30,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 08:15:30,436 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 08:15:30,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:15:22" (3/4) ... [2024-10-14 08:15:30,438 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 08:15:30,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 08:15:30,440 INFO L158 Benchmark]: Toolchain (without parser) took 9159.92ms. Allocated memory was 188.7MB in the beginning and 381.7MB in the end (delta: 192.9MB). Free memory was 118.3MB in the beginning and 239.2MB in the end (delta: -120.9MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2024-10-14 08:15:30,440 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory was 148.1MB in the beginning and 147.9MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:15:30,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.64ms. Allocated memory is still 188.7MB. Free memory was 118.1MB in the beginning and 156.5MB in the end (delta: -38.4MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-10-14 08:15:30,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.29ms. Allocated memory is still 188.7MB. Free memory was 156.5MB in the beginning and 153.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 08:15:30,441 INFO L158 Benchmark]: Boogie Preprocessor took 97.29ms. Allocated memory is still 188.7MB. Free memory was 153.3MB in the beginning and 149.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 08:15:30,441 INFO L158 Benchmark]: RCFGBuilder took 645.05ms. Allocated memory is still 188.7MB. Free memory was 148.2MB in the beginning and 119.7MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 08:15:30,441 INFO L158 Benchmark]: TraceAbstraction took 7963.15ms. Allocated memory was 188.7MB in the beginning and 381.7MB in the end (delta: 192.9MB). Free memory was 118.8MB in the beginning and 239.2MB in the end (delta: -120.4MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2024-10-14 08:15:30,442 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 381.7MB. Free memory is still 239.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:15:30,443 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory was 148.1MB in the beginning and 147.9MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.64ms. Allocated memory is still 188.7MB. Free memory was 118.1MB in the beginning and 156.5MB in the end (delta: -38.4MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.29ms. Allocated memory is still 188.7MB. Free memory was 156.5MB in the beginning and 153.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.29ms. Allocated memory is still 188.7MB. Free memory was 153.3MB in the beginning and 149.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 645.05ms. Allocated memory is still 188.7MB. Free memory was 148.2MB in the beginning and 119.7MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7963.15ms. Allocated memory was 188.7MB in the beginning and 381.7MB in the end (delta: 192.9MB). Free memory was 118.8MB in the beginning and 239.2MB in the end (delta: -120.4MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 381.7MB. Free memory is still 239.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of shiftLeft at line 76, overapproximation of someBinaryArithmeticFLOAToperation at line 82, overapproximation of someUnaryFLOAToperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] signed short int var_1_25 = 5; [L41] unsigned short int var_1_26 = 500; [L42] unsigned char var_1_27 = 1; [L43] signed short int var_1_28 = -32; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 1; [L46] signed long int var_1_31 = -2; [L47] unsigned char var_1_32 = 32; [L48] unsigned char var_1_33 = 16; [L49] unsigned char var_1_34 = 1; [L50] unsigned char last_1_var_1_1 = 0; [L51] unsigned long int last_1_var_1_9 = 10; [L52] signed short int last_1_var_1_14 = 32; [L53] unsigned char last_1_var_1_16 = 1; [L54] signed char last_1_var_1_20 = 1; [L166] isInitial = 1 [L167] FCALL initially() [L168] COND TRUE 1 [L169] CALL updateLastVariables() [L155] last_1_var_1_1 = var_1_1 [L156] last_1_var_1_9 = var_1_9 [L157] last_1_var_1_14 = var_1_14 [L158] last_1_var_1_16 = var_1_16 [L159] last_1_var_1_20 = var_1_20 [L169] RET updateLastVariables() [L170] CALL updateVariables() [L111] var_1_8 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L112] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L113] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L113] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L114] var_1_11 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L115] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L116] var_1_12 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L117] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L118] var_1_13 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L119] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L120] var_1_15 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L121] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L122] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L122] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L123] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L124] var_1_17 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L125] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L126] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L126] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L127] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L127] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L128] var_1_18 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L129] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L130] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L130] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L131] var_1_19 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L132] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L133] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L133] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L134] var_1_21 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L135] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L136] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L136] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L137] var_1_25 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L138] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L139] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L139] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L140] var_1_27 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L141] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L142] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L142] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L143] var_1_28 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L144] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L145] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L145] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L146] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L146] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L147] var_1_30 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L148] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L149] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L149] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L150] var_1_33 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_34=1, var_1_8=1, var_1_9=10] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_34=1, var_1_8=1, var_1_9=10] [L152] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L170] RET updateVariables() [L171] CALL step() [L58] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L59] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L64] var_1_29 = var_1_30 [L65] var_1_31 = var_1_24 [L66] var_1_32 = var_1_33 [L67] var_1_34 = var_1_30 [L68] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L69] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L70] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L75] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L76] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L76] COND FALSE !(stepLocal_6 <= (256u << last_1_var_1_16)) [L79] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L80] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L81] COND TRUE (! var_1_1) || stepLocal_4 [L82] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L90] var_1_20 = var_1_21 [L91] var_1_22 = var_1_12 [L92] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L93] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L96] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L96] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L97] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L102] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L103] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L104] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L105] COND FALSE !(stepLocal_2 <= (-5 + var_1_16)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L171] RET step() [L172] CALL, EXPR property() [L162] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L162] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L162-L163] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L172] RET, EXPR property() [L172] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1777 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1775 mSDsluCounter, 3016 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1807 mSDsCounter, 930 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1701 IncrementalHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 930 mSolverCounterUnsat, 1209 mSDtfsCounter, 1701 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 910 GetRequests, 840 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=6, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 1217 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1952 NumberOfCodeBlocks, 1952 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1762 ConstructedInterpolants, 0 QuantifiedInterpolants, 3477 SizeOfPredicates, 5 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 15012/15120 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-10-14 08:15:30,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.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 8eeb14fc4af4141dc041f376e493f1f94c8be383db2e49ff3554ffa1b21cacd5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:15:32,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:15:32,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 08:15:32,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:15:32,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:15:32,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:15:32,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:15:32,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:15:32,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:15:32,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:15:32,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:15:32,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:15:32,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:15:32,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:15:32,962 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:15:32,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:15:32,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:15:32,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:15:32,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:15:32,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:15:32,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:15:32,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:15:32,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:15:32,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 08:15:32,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 08:15:32,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:15:32,968 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 08:15:32,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:15:32,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:15:32,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:15:32,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:15:32,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:15:32,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:15:32,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:15:32,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:15:32,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:15:32,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:15:32,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:15:32,974 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 08:15:32,974 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 08:15:32,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:15:32,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:15:32,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:15:32,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:15:32,975 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 08:15:32,975 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 -> 8eeb14fc4af4141dc041f376e493f1f94c8be383db2e49ff3554ffa1b21cacd5 [2024-10-14 08:15:33,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:15:33,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:15:33,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:15:33,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:15:33,390 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:15:33,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-14 08:15:35,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:15:35,458 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:15:35,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-14 08:15:35,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c1906df/a48d5fa227d745eab8fdf74c504ad0f7/FLAG9c8751f91 [2024-10-14 08:15:35,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c1906df/a48d5fa227d745eab8fdf74c504ad0f7 [2024-10-14 08:15:35,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:15:35,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:15:35,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:15:35,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:15:35,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:15:35,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e9b8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35, skipping insertion in model container [2024-10-14 08:15:35,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:15:35,708 WARN L248 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_fillercode_fillercodesize_ps-cn-10_file-53.i[915,928] [2024-10-14 08:15:35,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:15:35,811 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:15:35,824 WARN L248 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_fillercode_fillercodesize_ps-cn-10_file-53.i[915,928] [2024-10-14 08:15:35,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:15:35,893 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:15:35,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35 WrapperNode [2024-10-14 08:15:35,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:15:35,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:15:35,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:15:35,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:15:35,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,947 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-14 08:15:35,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:15:35,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:15:35,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:15:35,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:15:35,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,979 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-10-14 08:15:35,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:35,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:15:35,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:15:35,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:15:35,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:15:35,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (1/1) ... [2024-10-14 08:15:36,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:15:36,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:15:36,043 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-10-14 08:15:36,064 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-10-14 08:15:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:15:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 08:15:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:15:36,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:15:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:15:36,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:15:36,211 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:15:36,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:15:36,886 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 08:15:36,887 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:15:36,924 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:15:36,928 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:15:36,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:15:36 BoogieIcfgContainer [2024-10-14 08:15:36,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:15:36,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:15:36,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:15:36,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:15:36,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:15:35" (1/3) ... [2024-10-14 08:15:36,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490a329c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:15:36, skipping insertion in model container [2024-10-14 08:15:36,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:15:35" (2/3) ... [2024-10-14 08:15:36,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490a329c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:15:36, skipping insertion in model container [2024-10-14 08:15:36,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:15:36" (3/3) ... [2024-10-14 08:15:36,937 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-14 08:15:36,951 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:15:36,951 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:15:37,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:15:37,040 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;@6886ff21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:15:37,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:15:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:15:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 08:15:37,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:37,062 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:37,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:37,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash 844942167, now seen corresponding path program 1 times [2024-10-14 08:15:37,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:15:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95879116] [2024-10-14 08:15:37,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:37,085 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-10-14 08:15:37,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:15:37,090 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-10-14 08:15:37,096 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-10-14 08:15:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:37,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 08:15:37,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:15:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-14 08:15:37,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:15:37,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:15:37,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95879116] [2024-10-14 08:15:37,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95879116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:37,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:37,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:15:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737263278] [2024-10-14 08:15:37,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:37,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:15:37,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:15:37,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:15:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:15:37,483 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 08:15:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:37,722 INFO L93 Difference]: Finished difference Result 139 states and 250 transitions. [2024-10-14 08:15:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:15:37,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-10-14 08:15:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:37,741 INFO L225 Difference]: With dead ends: 139 [2024-10-14 08:15:37,742 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 08:15:37,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-10-14 08:15:37,747 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:37,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:15:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 08:15:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-14 08:15:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:15:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2024-10-14 08:15:37,786 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 170 [2024-10-14 08:15:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:37,787 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. [2024-10-14 08:15:37,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 08:15:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. [2024-10-14 08:15:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 08:15:37,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:37,790 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:37,799 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-10-14 08:15:37,991 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-10-14 08:15:37,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:37,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1563857375, now seen corresponding path program 1 times [2024-10-14 08:15:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:15:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929149505] [2024-10-14 08:15:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:38,001 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-10-14 08:15:38,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:15:38,002 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-10-14 08:15:38,005 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-10-14 08:15:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:38,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 08:15:38,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:15:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:38,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:15:38,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:15:38,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929149505] [2024-10-14 08:15:38,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929149505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:38,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:38,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:15:38,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493441198] [2024-10-14 08:15:38,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:38,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:15:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:15:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:15:38,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:15:38,670 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:39,132 INFO L93 Difference]: Finished difference Result 203 states and 315 transitions. [2024-10-14 08:15:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:15:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-10-14 08:15:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:39,143 INFO L225 Difference]: With dead ends: 203 [2024-10-14 08:15:39,143 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 08:15:39,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 168 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-10-14 08:15:39,145 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:39,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 195 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 08:15:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 08:15:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-10-14 08:15:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 08:15:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 206 transitions. [2024-10-14 08:15:39,172 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 206 transitions. Word has length 170 [2024-10-14 08:15:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:39,173 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 206 transitions. [2024-10-14 08:15:39,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 206 transitions. [2024-10-14 08:15:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 08:15:39,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:39,175 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:39,184 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-10-14 08:15:39,375 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-10-14 08:15:39,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:39,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1355097612, now seen corresponding path program 1 times [2024-10-14 08:15:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:15:39,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082586920] [2024-10-14 08:15:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:39,382 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-10-14 08:15:39,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:15:39,383 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-10-14 08:15:39,384 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-10-14 08:15:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:39,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 08:15:39,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:15:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-10-14 08:15:39,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:15:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-14 08:15:40,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:15:40,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082586920] [2024-10-14 08:15:40,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082586920] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 08:15:40,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 08:15:40,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-10-14 08:15:40,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935497960] [2024-10-14 08:15:40,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 08:15:40,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 08:15:40,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:15:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 08:15:40,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-14 08:15:40,109 INFO L87 Difference]: Start difference. First operand 133 states and 206 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-14 08:15:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:41,338 INFO L93 Difference]: Finished difference Result 426 states and 642 transitions. [2024-10-14 08:15:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 08:15:41,339 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 171 [2024-10-14 08:15:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:41,342 INFO L225 Difference]: With dead ends: 426 [2024-10-14 08:15:41,342 INFO L226 Difference]: Without dead ends: 294 [2024-10-14 08:15:41,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2024-10-14 08:15:41,344 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 304 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:41,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 498 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 08:15:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-14 08:15:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 143. [2024-10-14 08:15:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 08:15:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2024-10-14 08:15:41,370 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 171 [2024-10-14 08:15:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:41,371 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2024-10-14 08:15:41,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-14 08:15:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2024-10-14 08:15:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 08:15:41,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:41,375 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:41,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 08:15:41,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:15:41,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:41,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1412355914, now seen corresponding path program 1 times [2024-10-14 08:15:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:15:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304482384] [2024-10-14 08:15:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:41,577 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-10-14 08:15:41,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:15:41,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:15:41,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 08:15:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:41,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 08:15:41,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:15:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:41,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:15:41,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:15:41,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304482384] [2024-10-14 08:15:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304482384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:15:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014493208] [2024-10-14 08:15:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:41,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:15:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:15:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:15:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:15:41,828 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:42,231 INFO L93 Difference]: Finished difference Result 361 states and 540 transitions. [2024-10-14 08:15:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:15:42,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2024-10-14 08:15:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:42,234 INFO L225 Difference]: With dead ends: 361 [2024-10-14 08:15:42,235 INFO L226 Difference]: Without dead ends: 219 [2024-10-14 08:15:42,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 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-10-14 08:15:42,236 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 100 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:42,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 295 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 08:15:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-14 08:15:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 141. [2024-10-14 08:15:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 08:15:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2024-10-14 08:15:42,261 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 171 [2024-10-14 08:15:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:42,261 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2024-10-14 08:15:42,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2024-10-14 08:15:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 08:15:42,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:42,263 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:42,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 08:15:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:15:42,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:42,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -45461988, now seen corresponding path program 1 times [2024-10-14 08:15:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:15:42,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322349904] [2024-10-14 08:15:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:42,469 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-10-14 08:15:42,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:15:42,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:15:42,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 08:15:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:42,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 08:15:42,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:15:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:15:43,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:15:43,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:15:43,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322349904] [2024-10-14 08:15:43,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322349904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:15:43,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:15:43,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:15:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178684130] [2024-10-14 08:15:43,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:15:43,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 08:15:43,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:15:43,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 08:15:43,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:15:43,370 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:15:43,959 INFO L93 Difference]: Finished difference Result 352 states and 524 transitions. [2024-10-14 08:15:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 08:15:43,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2024-10-14 08:15:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:15:43,979 INFO L225 Difference]: With dead ends: 352 [2024-10-14 08:15:43,979 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 08:15:43,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 08:15:43,981 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 52 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 08:15:43,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 344 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 08:15:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 08:15:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 196. [2024-10-14 08:15:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 105 states have (on average 1.2) internal successors, (126), 105 states have internal predecessors, (126), 84 states have call successors, (84), 6 states have call predecessors, (84), 6 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 08:15:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 294 transitions. [2024-10-14 08:15:44,061 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 294 transitions. Word has length 171 [2024-10-14 08:15:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:15:44,067 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 294 transitions. [2024-10-14 08:15:44,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:15:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 294 transitions. [2024-10-14 08:15:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 08:15:44,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:15:44,071 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 08:15:44,084 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 (6)] Ended with exit code 0 [2024-10-14 08:15:44,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10-14 08:15:44,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:15:44,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:15:44,273 INFO L85 PathProgramCache]: Analyzing trace with hash 931450851, now seen corresponding path program 1 times [2024-10-14 08:15:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:15:44,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619651550] [2024-10-14 08:15:44,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:15:44,278 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-10-14 08:15:44,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:15:44,279 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-14 08:15:44,281 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 (7)] Waiting until timeout for monitored process [2024-10-14 08:15:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:15:44,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 08:15:44,474 INFO L278 TraceCheckSpWp]: Computing forward predicates...