./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-50_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-50_file-11.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 85203f26a83ad69778292af9e7fa30addf5d4520d3d2767587ebe1fd49fdeceb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:40:23,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:40:23,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:40:23,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:40:23,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:40:23,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:40:23,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:40:23,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:40:23,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:40:23,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:40:23,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:40:23,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:40:23,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:40:23,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:40:23,210 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:40:23,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:40:23,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:40:23,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:40:23,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:40:23,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:40:23,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:40:23,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:40:23,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:40:23,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:40:23,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:40:23,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:40:23,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:40:23,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:40:23,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:40:23,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:40:23,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:40:23,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:40:23,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:40:23,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:40:23,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:40:23,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:40:23,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:40:23,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:40:23,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:40:23,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:40:23,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:40:23,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:40:23,220 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 -> 85203f26a83ad69778292af9e7fa30addf5d4520d3d2767587ebe1fd49fdeceb [2024-10-24 06:40:23,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:40:23,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:40:23,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:40:23,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:40:23,436 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:40:23,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-10-24 06:40:24,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:40:25,053 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:40:25,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-10-24 06:40:25,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2894c28/0c14e334e02a46af80b47c2d12b5ec40/FLAGab64405c8 [2024-10-24 06:40:25,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2894c28/0c14e334e02a46af80b47c2d12b5ec40 [2024-10-24 06:40:25,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:40:25,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:40:25,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:40:25,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:40:25,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:40:25,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467288fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25, skipping insertion in model container [2024-10-24 06:40:25,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:40:25,689 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-50_file-11.i[915,928] [2024-10-24 06:40:25,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:40:25,780 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:40:25,791 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-50_file-11.i[915,928] [2024-10-24 06:40:25,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:40:25,836 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:40:25,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25 WrapperNode [2024-10-24 06:40:25,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:40:25,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:40:25,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:40:25,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:40:25,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,899 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-10-24 06:40:25,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:40:25,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:40:25,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:40:25,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:40:25,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,924 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-24 06:40:25,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:40:25,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:40:25,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:40:25,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:40:25,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (1/1) ... [2024-10-24 06:40:25,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:40:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:40:25,981 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-24 06:40:25,991 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-24 06:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:40:26,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:40:26,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:40:26,116 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:40:26,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:40:26,461 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-24 06:40:26,462 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:40:26,515 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:40:26,516 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:40:26,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:40:26 BoogieIcfgContainer [2024-10-24 06:40:26,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:40:26,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:40:26,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:40:26,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:40:26,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:40:25" (1/3) ... [2024-10-24 06:40:26,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4853313d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:40:26, skipping insertion in model container [2024-10-24 06:40:26,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:25" (2/3) ... [2024-10-24 06:40:26,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4853313d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:40:26, skipping insertion in model container [2024-10-24 06:40:26,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:40:26" (3/3) ... [2024-10-24 06:40:26,525 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-10-24 06:40:26,539 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:40:26,539 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:40:26,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:40:26,593 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;@57943632, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:40:26,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:40:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 06:40:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-24 06:40:26,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:26,612 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:26,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:26,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1216838570, now seen corresponding path program 1 times [2024-10-24 06:40:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:40:26,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078539807] [2024-10-24 06:40:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:40:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:40:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:40:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:40:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:40:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:40:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:40:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:40:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:40:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:40:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:40:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:40:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:40:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:40:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:40:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:40:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:40:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:40:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:40:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:40:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:40:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:40:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:40:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:40:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:40:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:40:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:40:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:40:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:40:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:40:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:40:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:40:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:40:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:40:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 06:40:27,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:40:27,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078539807] [2024-10-24 06:40:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078539807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:27,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:27,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:40:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673792669] [2024-10-24 06:40:27,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:27,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:40:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:40:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:40:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:40:27,095 INFO L87 Difference]: Start difference. First operand has 97 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-24 06:40:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:27,142 INFO L93 Difference]: Finished difference Result 191 states and 347 transitions. [2024-10-24 06:40:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:40:27,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2024-10-24 06:40:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:27,152 INFO L225 Difference]: With dead ends: 191 [2024-10-24 06:40:27,153 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 06:40:27,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-24 06:40:27,160 INFO L432 NwaCegarLoop]: 149 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, 149 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-24 06:40:27,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:40:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 06:40:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-24 06:40:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 06:40:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 152 transitions. [2024-10-24 06:40:27,290 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 152 transitions. Word has length 203 [2024-10-24 06:40:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:27,290 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 152 transitions. [2024-10-24 06:40:27,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-24 06:40:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 152 transitions. [2024-10-24 06:40:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-24 06:40:27,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:27,302 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:27,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:40:27,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:27,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1671473688, now seen corresponding path program 1 times [2024-10-24 06:40:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:40:27,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624555874] [2024-10-24 06:40:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:40:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:40:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:40:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:40:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:40:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:40:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:40:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:40:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:40:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:40:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:40:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:40:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:40:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:40:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:40:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:40:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:40:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:40:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:40:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:40:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:40:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:40:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:40:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:40:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:40:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:40:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:40:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:40:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:40:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:40:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:40:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:40:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:40:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:40:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 06:40:27,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:40:27,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624555874] [2024-10-24 06:40:27,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624555874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:27,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:27,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:40:27,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029528734] [2024-10-24 06:40:27,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:27,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:40:27,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:40:27,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:40:27,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:40:27,820 INFO L87 Difference]: Start difference. First operand 95 states and 152 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:28,027 INFO L93 Difference]: Finished difference Result 249 states and 398 transitions. [2024-10-24 06:40:28,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:40:28,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2024-10-24 06:40:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:28,030 INFO L225 Difference]: With dead ends: 249 [2024-10-24 06:40:28,031 INFO L226 Difference]: Without dead ends: 155 [2024-10-24 06:40:28,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:40:28,035 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 90 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:28,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 556 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:40:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-24 06:40:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-10-24 06:40:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 06:40:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 244 transitions. [2024-10-24 06:40:28,056 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 244 transitions. Word has length 203 [2024-10-24 06:40:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:28,057 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 244 transitions. [2024-10-24 06:40:28,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 244 transitions. [2024-10-24 06:40:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-24 06:40:28,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:28,060 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:28,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:40:28,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:28,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash -986274704, now seen corresponding path program 1 times [2024-10-24 06:40:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:40:28,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791830331] [2024-10-24 06:40:28,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:28,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:40:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:40:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:40:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:40:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:40:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:40:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:40:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:40:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:40:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:40:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:40:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:40:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:40:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:40:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:40:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:40:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:40:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:40:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:40:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:40:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:40:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:40:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:40:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:40:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:40:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:40:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:40:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:40:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:40:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:40:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:40:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:40:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:40:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:40:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 06:40:28,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:40:28,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791830331] [2024-10-24 06:40:28,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791830331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:28,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:28,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:40:28,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120391685] [2024-10-24 06:40:28,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:28,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:40:28,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:40:28,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:40:28,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:40:28,573 INFO L87 Difference]: Start difference. First operand 152 states and 244 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:28,893 INFO L93 Difference]: Finished difference Result 515 states and 823 transitions. [2024-10-24 06:40:28,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:40:28,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-10-24 06:40:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:28,901 INFO L225 Difference]: With dead ends: 515 [2024-10-24 06:40:28,901 INFO L226 Difference]: Without dead ends: 364 [2024-10-24 06:40:28,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:40:28,906 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 184 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:28,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 686 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:40:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-24 06:40:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2024-10-24 06:40:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 221 states have (on average 1.4027149321266967) internal successors, (310), 224 states have internal predecessors, (310), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-10-24 06:40:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 576 transitions. [2024-10-24 06:40:28,960 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 576 transitions. Word has length 204 [2024-10-24 06:40:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:28,961 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 576 transitions. [2024-10-24 06:40:28,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 576 transitions. [2024-10-24 06:40:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 06:40:28,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:28,965 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:28,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:40:28,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:28,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1825087459, now seen corresponding path program 1 times [2024-10-24 06:40:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:40:28,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955744255] [2024-10-24 06:40:28,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:40:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:40:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:40:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:40:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:40:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:40:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:40:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:40:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:40:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:40:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:40:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:40:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:40:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:40:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:40:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:40:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:40:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:40:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:40:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:40:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:40:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:40:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:40:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:40:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:40:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:40:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:40:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:40:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:40:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:40:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:40:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:40:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:40:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:40:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 06:40:29,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:40:29,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955744255] [2024-10-24 06:40:29,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955744255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:29,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:29,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:40:29,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513376056] [2024-10-24 06:40:29,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:29,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:40:29,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:40:29,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:40:29,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:40:29,194 INFO L87 Difference]: Start difference. First operand 361 states and 576 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:29,323 INFO L93 Difference]: Finished difference Result 636 states and 1017 transitions. [2024-10-24 06:40:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:40:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-24 06:40:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:29,330 INFO L225 Difference]: With dead ends: 636 [2024-10-24 06:40:29,330 INFO L226 Difference]: Without dead ends: 485 [2024-10-24 06:40:29,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-24 06:40:29,335 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 106 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:29,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 449 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:40:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-24 06:40:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 372. [2024-10-24 06:40:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 232 states have (on average 1.4137931034482758) internal successors, (328), 235 states have internal predecessors, (328), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-10-24 06:40:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 594 transitions. [2024-10-24 06:40:29,378 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 594 transitions. Word has length 205 [2024-10-24 06:40:29,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:29,379 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 594 transitions. [2024-10-24 06:40:29,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:29,379 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 594 transitions. [2024-10-24 06:40:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 06:40:29,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:29,381 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:29,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:40:29,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:29,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1452459329, now seen corresponding path program 1 times [2024-10-24 06:40:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:40:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743491905] [2024-10-24 06:40:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:40:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:40:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:40:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:40:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:40:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:40:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:40:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:40:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:40:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:40:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:40:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:40:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:40:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:40:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:40:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:40:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:40:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:40:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:40:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:40:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:40:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:40:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:40:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:40:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:40:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:40:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:40:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:40:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:40:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:40:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:40:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:40:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:40:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:40:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 06:40:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:40:29,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743491905] [2024-10-24 06:40:29,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743491905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:29,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:29,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:40:29,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729259825] [2024-10-24 06:40:29,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:29,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:40:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:40:29,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:40:29,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:40:29,586 INFO L87 Difference]: Start difference. First operand 372 states and 594 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:29,729 INFO L93 Difference]: Finished difference Result 841 states and 1346 transitions. [2024-10-24 06:40:29,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:40:29,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-24 06:40:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:29,733 INFO L225 Difference]: With dead ends: 841 [2024-10-24 06:40:29,733 INFO L226 Difference]: Without dead ends: 529 [2024-10-24 06:40:29,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:40:29,735 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 89 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:29,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 562 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:40:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-10-24 06:40:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 360. [2024-10-24 06:40:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 220 states have (on average 1.3909090909090909) internal successors, (306), 223 states have internal predecessors, (306), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-10-24 06:40:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 572 transitions. [2024-10-24 06:40:29,774 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 572 transitions. Word has length 205 [2024-10-24 06:40:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:29,775 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 572 transitions. [2024-10-24 06:40:29,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 572 transitions. [2024-10-24 06:40:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 06:40:29,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:29,777 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:29,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:40:29,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:29,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash -841012093, now seen corresponding path program 1 times [2024-10-24 06:40:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:40:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360352754] [2024-10-24 06:40:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:40:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:40:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:40:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:40:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:40:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:40:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:40:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:40:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:40:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:40:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:40:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:40:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:40:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:40:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:40:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:40:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:40:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:40:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:40:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:40:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:40:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:40:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:40:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:40:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:40:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:40:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:40:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:40:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:40:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:40:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:40:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:40:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:40:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:40:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 06:40:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:40:30,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360352754] [2024-10-24 06:40:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360352754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:30,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:40:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520223564] [2024-10-24 06:40:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:40:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:40:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:40:30,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:40:30,411 INFO L87 Difference]: Start difference. First operand 360 states and 572 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:30,462 INFO L93 Difference]: Finished difference Result 694 states and 1102 transitions. [2024-10-24 06:40:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:40:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-24 06:40:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:30,465 INFO L225 Difference]: With dead ends: 694 [2024-10-24 06:40:30,465 INFO L226 Difference]: Without dead ends: 394 [2024-10-24 06:40:30,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:40:30,467 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 26 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:30,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 548 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:40:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-24 06:40:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 376. [2024-10-24 06:40:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 236 states have (on average 1.3983050847457628) internal successors, (330), 239 states have internal predecessors, (330), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-10-24 06:40:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 596 transitions. [2024-10-24 06:40:30,497 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 596 transitions. Word has length 205 [2024-10-24 06:40:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:30,497 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 596 transitions. [2024-10-24 06:40:30,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 596 transitions. [2024-10-24 06:40:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 06:40:30,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:30,499 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:30,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 06:40:30,499 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:30,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash -840952511, now seen corresponding path program 1 times [2024-10-24 06:40:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:40:30,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899405829] [2024-10-24 06:40:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:30,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:40:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:40:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:40:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:40:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:40:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:40:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:40:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:40:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:40:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:40:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:40:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:40:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:40:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:40:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:40:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:40:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:40:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:40:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:40:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:40:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:40:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:40:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:40:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:40:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:40:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:40:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:40:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:40:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:40:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:40:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:40:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:40:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:40:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:40:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 06:40:30,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:40:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899405829] [2024-10-24 06:40:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899405829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:30,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:40:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648235528] [2024-10-24 06:40:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:30,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:40:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:40:30,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:40:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:40:30,787 INFO L87 Difference]: Start difference. First operand 376 states and 596 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:30,971 INFO L93 Difference]: Finished difference Result 805 states and 1283 transitions. [2024-10-24 06:40:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:40:30,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-24 06:40:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:30,974 INFO L225 Difference]: With dead ends: 805 [2024-10-24 06:40:30,974 INFO L226 Difference]: Without dead ends: 489 [2024-10-24 06:40:30,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 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-24 06:40:30,976 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 119 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:30,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 515 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:40:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-24 06:40:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 430. [2024-10-24 06:40:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 290 states have (on average 1.4413793103448276) internal successors, (418), 292 states have internal predecessors, (418), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2024-10-24 06:40:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 684 transitions. [2024-10-24 06:40:31,031 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 684 transitions. Word has length 205 [2024-10-24 06:40:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:31,031 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 684 transitions. [2024-10-24 06:40:31,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 684 transitions. [2024-10-24 06:40:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-24 06:40:31,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:31,033 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:31,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 06:40:31,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:31,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:31,034 INFO L85 PathProgramCache]: Analyzing trace with hash 20105071, now seen corresponding path program 1 times [2024-10-24 06:40:31,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:40:31,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511676888] [2024-10-24 06:40:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:40:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:40:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:40:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:40:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:40:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:40:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:40:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:40:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:40:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:40:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:40:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:40:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:40:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:40:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:40:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:40:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:40:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:40:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:40:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:40:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:40:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:40:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:40:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:40:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:40:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 06:40:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:40:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 06:40:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:40:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:40:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:40:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:40:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:40:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:40:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-24 06:40:31,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:40:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511676888] [2024-10-24 06:40:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511676888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:40:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078945178] [2024-10-24 06:40:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:31,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:40:31,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:40:31,434 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-24 06:40:31,435 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-24 06:40:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:31,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 06:40:31,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:40:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-10-24 06:40:31,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:40:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-24 06:40:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078945178] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:40:32,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:40:32,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-24 06:40:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200329958] [2024-10-24 06:40:32,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:40:32,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 06:40:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:40:32,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 06:40:32,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:40:32,215 INFO L87 Difference]: Start difference. First operand 430 states and 684 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-24 06:40:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:32,482 INFO L93 Difference]: Finished difference Result 772 states and 1202 transitions. [2024-10-24 06:40:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 06:40:32,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 206 [2024-10-24 06:40:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:32,485 INFO L225 Difference]: With dead ends: 772 [2024-10-24 06:40:32,485 INFO L226 Difference]: Without dead ends: 456 [2024-10-24 06:40:32,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2024-10-24 06:40:32,487 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 275 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:32,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 258 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:40:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-24 06:40:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 434. [2024-10-24 06:40:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 289 states have (on average 1.3875432525951557) internal successors, (401), 291 states have internal predecessors, (401), 133 states have call successors, (133), 11 states have call predecessors, (133), 11 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2024-10-24 06:40:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 667 transitions. [2024-10-24 06:40:32,527 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 667 transitions. Word has length 206 [2024-10-24 06:40:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:32,528 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 667 transitions. [2024-10-24 06:40:32,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-24 06:40:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 667 transitions. [2024-10-24 06:40:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-24 06:40:32,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:32,530 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:32,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:40:32,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:40:32,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:32,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash -189013624, now seen corresponding path program 1 times [2024-10-24 06:40:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:40:32,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603242526] [2024-10-24 06:40:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:40:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:40:32,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:40:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:40:33,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:40:33,054 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:40:33,055 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:40:33,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 06:40:33,058 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:40:33,153 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:40:33,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:40:33 BoogieIcfgContainer [2024-10-24 06:40:33,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:40:33,156 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:40:33,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:40:33,156 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:40:33,157 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:40:26" (3/4) ... [2024-10-24 06:40:33,158 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:40:33,159 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:40:33,159 INFO L158 Benchmark]: Toolchain (without parser) took 7714.32ms. Allocated memory was 167.8MB in the beginning and 346.0MB in the end (delta: 178.3MB). Free memory was 96.9MB in the beginning and 185.4MB in the end (delta: -88.5MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2024-10-24 06:40:33,160 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:40:33,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.10ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 96.6MB in the beginning and 197.2MB in the end (delta: -100.6MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-10-24 06:40:33,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.48ms. Allocated memory is still 226.5MB. Free memory was 197.2MB in the beginning and 194.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:40:33,160 INFO L158 Benchmark]: Boogie Preprocessor took 40.27ms. Allocated memory is still 226.5MB. Free memory was 194.0MB in the beginning and 190.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:40:33,160 INFO L158 Benchmark]: RCFGBuilder took 575.50ms. Allocated memory is still 226.5MB. Free memory was 190.9MB in the beginning and 160.5MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 06:40:33,161 INFO L158 Benchmark]: TraceAbstraction took 6636.63ms. Allocated memory was 226.5MB in the beginning and 346.0MB in the end (delta: 119.5MB). Free memory was 160.5MB in the beginning and 185.4MB in the end (delta: -24.9MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2024-10-24 06:40:33,161 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 346.0MB. Free memory is still 185.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:40:33,162 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.14ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.10ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 96.6MB in the beginning and 197.2MB in the end (delta: -100.6MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.48ms. Allocated memory is still 226.5MB. Free memory was 197.2MB in the beginning and 194.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.27ms. Allocated memory is still 226.5MB. Free memory was 194.0MB in the beginning and 190.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 575.50ms. Allocated memory is still 226.5MB. Free memory was 190.9MB in the beginning and 160.5MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6636.63ms. Allocated memory was 226.5MB in the beginning and 346.0MB in the end (delta: 119.5MB). Free memory was 160.5MB in the beginning and 185.4MB in the end (delta: -24.9MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 346.0MB. Free memory is still 185.4MB. 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 76, overapproximation of shiftRight at line 68, overapproximation of someUnaryDOUBLEoperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of someBinaryArithmeticFLOAToperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] signed char var_1_24 = -128; [L42] unsigned char var_1_25 = 10; [L43] signed char var_1_26 = 10; [L44] unsigned char var_1_27 = 128; [L45] unsigned char var_1_28 = 100; [L46] unsigned char var_1_29 = 1; [L47] float var_1_30 = 31.3; [L48] float var_1_31 = 1.5; [L49] float var_1_32 = 15.25; [L50] double var_1_33 = 128.8; [L51] signed char var_1_34 = 4; [L52] signed char var_1_35 = 1; [L53] unsigned char var_1_36 = 16; [L54] unsigned long int last_1_var_1_10 = 128; [L55] unsigned long int last_1_var_1_16 = 1; [L56] double last_1_var_1_19 = 3.8; [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L198] last_1_var_1_10 = var_1_10 [L199] last_1_var_1_16 = var_1_16 [L200] last_1_var_1_19 = var_1_19 [L210] RET updateLastVariables() [L211] CALL updateVariables() [L145] var_1_2 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] var_1_3 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L149] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L150] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L151] var_1_7 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L153] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L154] var_1_8 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L155] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L156] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L156] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L157] var_1_9 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L158] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] var_1_11 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L161] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L162] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L162] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L163] var_1_17 = __VERIFIER_nondet_ulong() [L164] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L164] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L165] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L166] var_1_18 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L167] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L168] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L169] var_1_20 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L170] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L171] var_1_24 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_24 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L172] RET assume_abort_if_not(var_1_24 >= -128) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L174] var_1_26 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L175] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L177] var_1_27 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L178] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L179] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L179] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L180] var_1_28 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L181] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L182] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L182] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L183] var_1_29 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L184] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L185] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L185] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L186] var_1_31 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L187] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L188] var_1_32 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L189] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L190] var_1_34 = __VERIFIER_nondet_char() [L191] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L191] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L192] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L192] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L193] var_1_35 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L194] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L195] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L195] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L211] RET updateVariables() [L212] CALL step() [L60] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L61] COND FALSE !(var_1_22 > var_1_24) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] EXPR var_1_26 >> var_1_23 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] EXPR ((var_1_22) < ((var_1_26 >> var_1_23))) ? (var_1_22) : ((var_1_26 >> var_1_23)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] COND FALSE !(var_1_24 <= ((((var_1_22) < ((var_1_26 >> var_1_23))) ? (var_1_22) : ((var_1_26 >> var_1_23))))) [L71] COND TRUE \read(var_1_29) [L72] var_1_25 = var_1_28 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L75] COND TRUE \read(var_1_29) [L76] var_1_30 = ((((var_1_31) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_31) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L78] COND FALSE !(var_1_26 >= var_1_24) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L91] COND FALSE !(var_1_27 >= (var_1_28 + var_1_22)) [L100] var_1_36 = var_1_28 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] unsigned long int stepLocal_1 = last_1_var_1_16; [L103] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L104] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L105] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L113] COND TRUE var_1_12 == var_1_12 [L114] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L116] var_1_1 = (var_1_2 || (! var_1_3)) [L117] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L118] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L119] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L120] COND FALSE !(var_1_19 >= var_1_19) [L125] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L130] COND TRUE var_1_19 != var_1_19 [L131] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L139] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L140] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L141] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L212] RET step() [L213] CALL, EXPR property() [L203-L204] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 891 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 3723 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2366 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 917 IncrementalHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 1357 mSDtfsCounter, 917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1020 GetRequests, 983 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=434occurred in iteration=8, InterpolantAutomatonStates: 41, 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, 387 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2049 NumberOfCodeBlocks, 2049 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2038 ConstructedInterpolants, 0 QuantifiedInterpolants, 4014 SizeOfPredicates, 3 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 20859/21120 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-24 06:40:33,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-50_file-11.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 85203f26a83ad69778292af9e7fa30addf5d4520d3d2767587ebe1fd49fdeceb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:40:35,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:40:35,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:40:35,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:40:35,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:40:35,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:40:35,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:40:35,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:40:35,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:40:35,598 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:40:35,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:40:35,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:40:35,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:40:35,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:40:35,600 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:40:35,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:40:35,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:40:35,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:40:35,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:40:35,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:40:35,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:40:35,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:40:35,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:40:35,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:40:35,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:40:35,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:40:35,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:40:35,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:40:35,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:40:35,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:40:35,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:40:35,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:40:35,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:40:35,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:40:35,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:40:35,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:40:35,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:40:35,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:40:35,608 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:40:35,608 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:40:35,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:40:35,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:40:35,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:40:35,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:40:35,610 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:40:35,610 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 -> 85203f26a83ad69778292af9e7fa30addf5d4520d3d2767587ebe1fd49fdeceb [2024-10-24 06:40:35,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:40:35,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:40:35,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:40:35,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:40:35,923 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:40:35,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-10-24 06:40:37,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:40:37,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:40:37,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-10-24 06:40:37,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ca658f1/2537b8c6370c4900b24ecb1ffc8013aa/FLAGb886cde09 [2024-10-24 06:40:37,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ca658f1/2537b8c6370c4900b24ecb1ffc8013aa [2024-10-24 06:40:37,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:40:37,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:40:37,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:40:37,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:40:37,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:40:37,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:40:37" (1/1) ... [2024-10-24 06:40:37,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4873b516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:37, skipping insertion in model container [2024-10-24 06:40:37,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:40:37" (1/1) ... [2024-10-24 06:40:37,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:40:38,060 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-50_file-11.i[915,928] [2024-10-24 06:40:38,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:40:38,153 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:40:38,163 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-50_file-11.i[915,928] [2024-10-24 06:40:38,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:40:38,199 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:40:38,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38 WrapperNode [2024-10-24 06:40:38,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:40:38,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:40:38,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:40:38,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:40:38,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,285 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-24 06:40:38,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:40:38,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:40:38,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:40:38,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:40:38,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,343 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-24 06:40:38,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:40:38,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:40:38,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:40:38,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:40:38,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (1/1) ... [2024-10-24 06:40:38,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:40:38,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:40:38,406 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-24 06:40:38,408 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-24 06:40:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:40:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:40:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:40:38,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:40:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:40:38,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:40:38,546 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:40:38,548 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:40:41,783 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 06:40:41,784 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:40:41,838 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:40:41,839 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:40:41,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:40:41 BoogieIcfgContainer [2024-10-24 06:40:41,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:40:41,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:40:41,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:40:41,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:40:41,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:40:37" (1/3) ... [2024-10-24 06:40:41,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddff9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:40:41, skipping insertion in model container [2024-10-24 06:40:41,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38" (2/3) ... [2024-10-24 06:40:41,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddff9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:40:41, skipping insertion in model container [2024-10-24 06:40:41,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:40:41" (3/3) ... [2024-10-24 06:40:41,845 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-10-24 06:40:41,857 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:40:41,857 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:40:41,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:40:41,914 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;@36216c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:40:41,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:40:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 06:40:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-24 06:40:41,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:41,930 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:41,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:41,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1532041677, now seen corresponding path program 1 times [2024-10-24 06:40:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:40:41,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869793096] [2024-10-24 06:40:41,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:41,946 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-24 06:40:41,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:40:41,951 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-24 06:40:41,961 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-24 06:40:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:42,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:40:42,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:40:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1024 proven. 0 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2024-10-24 06:40:42,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:40:42,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:40:42,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869793096] [2024-10-24 06:40:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869793096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:42,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:42,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:40:42,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724923984] [2024-10-24 06:40:42,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:42,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:40:42,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:40:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:40:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:40:42,301 INFO L87 Difference]: Start difference. First operand has 89 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-24 06:40:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:42,397 INFO L93 Difference]: Finished difference Result 175 states and 323 transitions. [2024-10-24 06:40:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:40:42,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2024-10-24 06:40:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:42,410 INFO L225 Difference]: With dead ends: 175 [2024-10-24 06:40:42,410 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 06:40:42,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 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-24 06:40:42,417 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:42,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:40:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 06:40:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 06:40:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 06:40:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2024-10-24 06:40:42,455 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 201 [2024-10-24 06:40:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:42,456 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2024-10-24 06:40:42,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-24 06:40:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2024-10-24 06:40:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-24 06:40:42,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:42,460 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:42,468 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-24 06:40:42,664 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-24 06:40:42,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:42,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:42,667 INFO L85 PathProgramCache]: Analyzing trace with hash 873159151, now seen corresponding path program 1 times [2024-10-24 06:40:42,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:40:42,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925147745] [2024-10-24 06:40:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:42,668 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-24 06:40:42,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:40:42,669 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-24 06:40:42,672 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-24 06:40:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:42,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:40:42,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:40:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 06:40:44,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:40:44,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:40:44,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925147745] [2024-10-24 06:40:44,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925147745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:44,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:44,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:40:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101530538] [2024-10-24 06:40:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:44,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:40:44,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:40:44,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:40:44,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:40:44,247 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:44,750 INFO L93 Difference]: Finished difference Result 260 states and 416 transitions. [2024-10-24 06:40:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:40:44,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-24 06:40:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:44,757 INFO L225 Difference]: With dead ends: 260 [2024-10-24 06:40:44,757 INFO L226 Difference]: Without dead ends: 174 [2024-10-24 06:40:44,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:40:44,759 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 96 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:44,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 463 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:40:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-24 06:40:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2024-10-24 06:40:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-24 06:40:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 252 transitions. [2024-10-24 06:40:44,793 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 252 transitions. Word has length 201 [2024-10-24 06:40:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:44,794 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 252 transitions. [2024-10-24 06:40:44,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 252 transitions. [2024-10-24 06:40:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-24 06:40:44,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:44,800 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:44,817 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 (3)] Ended with exit code 0 [2024-10-24 06:40:45,000 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-24 06:40:45,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:45,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:45,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1619746473, now seen corresponding path program 1 times [2024-10-24 06:40:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:40:45,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181173460] [2024-10-24 06:40:45,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:45,002 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-24 06:40:45,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:40:45,007 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-24 06:40:45,011 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-24 06:40:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:45,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:40:45,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:40:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-10-24 06:40:45,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:40:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-24 06:40:46,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:40:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181173460] [2024-10-24 06:40:46,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181173460] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:40:46,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:40:46,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 06:40:46,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569488087] [2024-10-24 06:40:46,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:40:46,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 06:40:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:40:46,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 06:40:46,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 06:40:46,028 INFO L87 Difference]: Start difference. First operand 157 states and 252 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-24 06:40:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:46,501 INFO L93 Difference]: Finished difference Result 259 states and 404 transitions. [2024-10-24 06:40:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 06:40:46,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 202 [2024-10-24 06:40:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:46,506 INFO L225 Difference]: With dead ends: 259 [2024-10-24 06:40:46,506 INFO L226 Difference]: Without dead ends: 173 [2024-10-24 06:40:46,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-24 06:40:46,508 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 160 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:46,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 217 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:40:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-24 06:40:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 165. [2024-10-24 06:40:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-24 06:40:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 256 transitions. [2024-10-24 06:40:46,529 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 256 transitions. Word has length 202 [2024-10-24 06:40:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:46,529 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 256 transitions. [2024-10-24 06:40:46,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-24 06:40:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 256 transitions. [2024-10-24 06:40:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-24 06:40:46,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:46,531 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:46,540 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-24 06:40:46,735 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-24 06:40:46,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:46,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:46,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2137890700, now seen corresponding path program 1 times [2024-10-24 06:40:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:40:46,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527933912] [2024-10-24 06:40:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:46,737 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-24 06:40:46,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:40:46,743 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-24 06:40:46,743 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-24 06:40:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:46,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:40:46,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:40:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 06:40:47,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:40:47,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:40:47,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527933912] [2024-10-24 06:40:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527933912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:40:47,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:40:47,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:40:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121199458] [2024-10-24 06:40:47,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:40:47,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:40:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:40:47,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:40:47,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:40:47,347 INFO L87 Difference]: Start difference. First operand 165 states and 256 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:50,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:40:52,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:40:53,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:40:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:40:53,835 INFO L93 Difference]: Finished difference Result 259 states and 401 transitions. [2024-10-24 06:40:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:40:53,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2024-10-24 06:40:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:40:53,838 INFO L225 Difference]: With dead ends: 259 [2024-10-24 06:40:53,838 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 06:40:53,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 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-24 06:40:53,840 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 103 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:40:53,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 324 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-24 06:40:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 06:40:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2024-10-24 06:40:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-24 06:40:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 254 transitions. [2024-10-24 06:40:53,875 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 254 transitions. Word has length 203 [2024-10-24 06:40:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:40:53,876 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 254 transitions. [2024-10-24 06:40:53,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 06:40:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 254 transitions. [2024-10-24 06:40:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 06:40:53,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:40:53,878 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:40:53,887 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 (5)] Forceful destruction successful, exit code 0 [2024-10-24 06:40:54,082 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-24 06:40:54,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:40:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:40:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1596010155, now seen corresponding path program 1 times [2024-10-24 06:40:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:40:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333549657] [2024-10-24 06:40:54,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:40:54,086 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-24 06:40:54,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:40:54,089 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-24 06:40:54,090 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-24 06:40:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:40:54,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 06:40:54,278 INFO L278 TraceCheckSpWp]: Computing forward predicates...