./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-25_file-97.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-25_file-97.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 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:31:13,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:31:13,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:31:13,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:31:13,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:31:13,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:31:13,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:31:13,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:31:13,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:31:13,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:31:13,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:31:13,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:31:13,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:31:13,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:31:13,629 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:31:13,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:31:13,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:31:13,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:31:13,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:31:13,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:31:13,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:31:13,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:31:13,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:31:13,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:31:13,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:31:13,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:31:13,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:31:13,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:31:13,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:31:13,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:31:13,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:31:13,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:31:13,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:31:13,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:31:13,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:31:13,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:31:13,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:31:13,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:31:13,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:31:13,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:31:13,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:31:13,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:31:13,642 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 -> 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 [2024-10-24 06:31:13,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:31:13,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:31:13,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:31:13,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:31:13,949 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:31:13,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-24 06:31:15,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:31:15,821 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:31:15,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-24 06:31:15,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e7708a3/e499a4b7767144529c600757139eb27d/FLAG3a953a756 [2024-10-24 06:31:15,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e7708a3/e499a4b7767144529c600757139eb27d [2024-10-24 06:31:15,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:31:15,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:31:15,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:31:15,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:31:15,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:31:15,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:31:15" (1/1) ... [2024-10-24 06:31:15,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1293c468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:15, skipping insertion in model container [2024-10-24 06:31:15,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:31:15" (1/1) ... [2024-10-24 06:31:15,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:31:16,109 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-25_file-97.i[915,928] [2024-10-24 06:31:16,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:31:16,240 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:31:16,267 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-25_file-97.i[915,928] [2024-10-24 06:31:16,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:31:16,340 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:31:16,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16 WrapperNode [2024-10-24 06:31:16,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:31:16,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:31:16,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:31:16,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:31:16,351 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:31:16" (1/1) ... [2024-10-24 06:31:16,365 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:31:16" (1/1) ... [2024-10-24 06:31:16,416 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 276 [2024-10-24 06:31:16,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:31:16,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:31:16,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:31:16,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:31:16,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,455 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:31:16,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:31:16,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:31:16,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:31:16,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:31:16,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (1/1) ... [2024-10-24 06:31:16,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:31:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:31:16,534 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:31:16,537 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:31:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:31:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:31:16,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:31:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:31:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:31:16,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:31:16,714 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:31:16,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:31:17,217 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-24 06:31:17,218 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:31:17,265 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:31:17,265 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:31:17,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:31:17 BoogieIcfgContainer [2024-10-24 06:31:17,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:31:17,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:31:17,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:31:17,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:31:17,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:31:15" (1/3) ... [2024-10-24 06:31:17,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b196952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:31:17, skipping insertion in model container [2024-10-24 06:31:17,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:16" (2/3) ... [2024-10-24 06:31:17,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b196952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:31:17, skipping insertion in model container [2024-10-24 06:31:17,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:31:17" (3/3) ... [2024-10-24 06:31:17,280 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-24 06:31:17,302 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:31:17,303 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:31:17,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:31:17,399 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;@7c7bc8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:31:17,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:31:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 06:31:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-24 06:31:17,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:17,426 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:17,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:17,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1881038183, now seen corresponding path program 1 times [2024-10-24 06:31:17,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787783591] [2024-10-24 06:31:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:17,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787783591] [2024-10-24 06:31:18,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787783591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:18,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:18,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:31:18,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683286284] [2024-10-24 06:31:18,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:18,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:31:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:31:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:31:18,261 INFO L87 Difference]: Start difference. First operand has 114 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-24 06:31:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:18,328 INFO L93 Difference]: Finished difference Result 225 states and 397 transitions. [2024-10-24 06:31:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:31:18,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-10-24 06:31:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:18,345 INFO L225 Difference]: With dead ends: 225 [2024-10-24 06:31:18,346 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 06:31:18,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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:31:18,359 INFO L432 NwaCegarLoop]: 174 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, 174 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:31:18,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:31:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 06:31:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-24 06:31:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 06:31:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 177 transitions. [2024-10-24 06:31:18,413 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 177 transitions. Word has length 218 [2024-10-24 06:31:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:18,414 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 177 transitions. [2024-10-24 06:31:18,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-24 06:31:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 177 transitions. [2024-10-24 06:31:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-24 06:31:18,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:18,421 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:18,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:31:18,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:18,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:18,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1022041691, now seen corresponding path program 1 times [2024-10-24 06:31:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:18,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463495285] [2024-10-24 06:31:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:18,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463495285] [2024-10-24 06:31:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463495285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:18,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:18,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:31:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970301005] [2024-10-24 06:31:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:31:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:18,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:31:18,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:31:18,890 INFO L87 Difference]: Start difference. First operand 112 states and 177 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:18,962 INFO L93 Difference]: Finished difference Result 253 states and 398 transitions. [2024-10-24 06:31:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:31:18,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-10-24 06:31:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:18,967 INFO L225 Difference]: With dead ends: 253 [2024-10-24 06:31:18,967 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 06:31:18,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:31:18,969 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 125 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:18,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 303 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:31:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 06:31:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-10-24 06:31:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 88 states have internal predecessors, (118), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 06:31:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 220 transitions. [2024-10-24 06:31:19,005 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 220 transitions. Word has length 218 [2024-10-24 06:31:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:19,006 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 220 transitions. [2024-10-24 06:31:19,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 220 transitions. [2024-10-24 06:31:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 06:31:19,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:19,034 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:19,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:31:19,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:19,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash 728968384, now seen corresponding path program 1 times [2024-10-24 06:31:19,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:19,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086554438] [2024-10-24 06:31:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:19,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086554438] [2024-10-24 06:31:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086554438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:19,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:19,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:31:19,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179631309] [2024-10-24 06:31:19,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:19,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:31:19,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:19,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:31:19,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:31:19,406 INFO L87 Difference]: Start difference. First operand 141 states and 220 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:19,494 INFO L93 Difference]: Finished difference Result 357 states and 553 transitions. [2024-10-24 06:31:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:31:19,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-10-24 06:31:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:19,506 INFO L225 Difference]: With dead ends: 357 [2024-10-24 06:31:19,506 INFO L226 Difference]: Without dead ends: 242 [2024-10-24 06:31:19,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:31:19,511 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 163 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:19,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 446 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:31:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-24 06:31:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2024-10-24 06:31:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 138 states have (on average 1.289855072463768) internal successors, (178), 140 states have internal predecessors, (178), 86 states have call successors, (86), 4 states have call predecessors, (86), 4 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-24 06:31:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 350 transitions. [2024-10-24 06:31:19,575 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 350 transitions. Word has length 219 [2024-10-24 06:31:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:19,577 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 350 transitions. [2024-10-24 06:31:19,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 350 transitions. [2024-10-24 06:31:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 06:31:19,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:19,582 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:19,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:31:19,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:19,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash -282148866, now seen corresponding path program 1 times [2024-10-24 06:31:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:19,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880826997] [2024-10-24 06:31:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:20,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:20,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880826997] [2024-10-24 06:31:20,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880826997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:20,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:31:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444278733] [2024-10-24 06:31:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:20,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:31:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:20,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:31:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:31:20,316 INFO L87 Difference]: Start difference. First operand 229 states and 350 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:20,848 INFO L93 Difference]: Finished difference Result 674 states and 1029 transitions. [2024-10-24 06:31:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:31:20,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-10-24 06:31:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:20,856 INFO L225 Difference]: With dead ends: 674 [2024-10-24 06:31:20,859 INFO L226 Difference]: Without dead ends: 471 [2024-10-24 06:31:20,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:31:20,861 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 258 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:20,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 580 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:31:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-10-24 06:31:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 324. [2024-10-24 06:31:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 214 states have internal predecessors, (285), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 06:31:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 495 transitions. [2024-10-24 06:31:20,930 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 495 transitions. Word has length 219 [2024-10-24 06:31:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:20,931 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 495 transitions. [2024-10-24 06:31:20,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 495 transitions. [2024-10-24 06:31:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-24 06:31:20,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:20,935 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:20,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:31:20,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:20,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1184047692, now seen corresponding path program 1 times [2024-10-24 06:31:20,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:20,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348654933] [2024-10-24 06:31:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:21,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:21,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348654933] [2024-10-24 06:31:21,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348654933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:21,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:21,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 06:31:21,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515189239] [2024-10-24 06:31:21,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 06:31:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 06:31:21,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:31:21,719 INFO L87 Difference]: Start difference. First operand 324 states and 495 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:22,274 INFO L93 Difference]: Finished difference Result 749 states and 1132 transitions. [2024-10-24 06:31:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:31:22,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2024-10-24 06:31:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:22,279 INFO L225 Difference]: With dead ends: 749 [2024-10-24 06:31:22,280 INFO L226 Difference]: Without dead ends: 485 [2024-10-24 06:31:22,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 06:31:22,282 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 210 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:22,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 733 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 06:31:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-24 06:31:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 462. [2024-10-24 06:31:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 314 states have (on average 1.3121019108280254) internal successors, (412), 315 states have internal predecessors, (412), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-24 06:31:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 692 transitions. [2024-10-24 06:31:22,345 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 692 transitions. Word has length 220 [2024-10-24 06:31:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:22,346 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 692 transitions. [2024-10-24 06:31:22,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 692 transitions. [2024-10-24 06:31:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-24 06:31:22,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:22,350 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:22,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:31:22,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:22,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1431479128, now seen corresponding path program 1 times [2024-10-24 06:31:22,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:22,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279452218] [2024-10-24 06:31:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:22,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279452218] [2024-10-24 06:31:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279452218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:31:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514204521] [2024-10-24 06:31:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:22,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:31:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:22,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:31:22,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:31:22,724 INFO L87 Difference]: Start difference. First operand 462 states and 692 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:23,222 INFO L93 Difference]: Finished difference Result 724 states and 1090 transitions. [2024-10-24 06:31:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 06:31:23,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 221 [2024-10-24 06:31:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:23,227 INFO L225 Difference]: With dead ends: 724 [2024-10-24 06:31:23,227 INFO L226 Difference]: Without dead ends: 588 [2024-10-24 06:31:23,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 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:31:23,232 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 286 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:23,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1075 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:31:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-24 06:31:23,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 468. [2024-10-24 06:31:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 320 states have (on average 1.315625) internal successors, (421), 321 states have internal predecessors, (421), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-24 06:31:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 701 transitions. [2024-10-24 06:31:23,321 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 701 transitions. Word has length 221 [2024-10-24 06:31:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:23,322 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 701 transitions. [2024-10-24 06:31:23,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2024-10-24 06:31:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-24 06:31:23,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:23,324 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:23,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 06:31:23,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:23,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:23,325 INFO L85 PathProgramCache]: Analyzing trace with hash 725024691, now seen corresponding path program 1 times [2024-10-24 06:31:23,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:23,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708500610] [2024-10-24 06:31:23,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:23,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:23,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:23,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708500610] [2024-10-24 06:31:23,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708500610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:23,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:23,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:31:23,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756718103] [2024-10-24 06:31:23,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:23,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:31:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:23,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:31:23,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:31:23,892 INFO L87 Difference]: Start difference. First operand 468 states and 701 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:24,009 INFO L93 Difference]: Finished difference Result 887 states and 1327 transitions. [2024-10-24 06:31:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:31:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 221 [2024-10-24 06:31:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:24,013 INFO L225 Difference]: With dead ends: 887 [2024-10-24 06:31:24,014 INFO L226 Difference]: Without dead ends: 479 [2024-10-24 06:31:24,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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:31:24,017 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 151 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:24,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 684 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:31:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-24 06:31:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 468. [2024-10-24 06:31:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 320 states have (on average 1.290625) internal successors, (413), 321 states have internal predecessors, (413), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-24 06:31:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 693 transitions. [2024-10-24 06:31:24,120 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 693 transitions. Word has length 221 [2024-10-24 06:31:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:24,121 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 693 transitions. [2024-10-24 06:31:24,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 693 transitions. [2024-10-24 06:31:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 06:31:24,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:24,124 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:24,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 06:31:24,125 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:24,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1523150936, now seen corresponding path program 1 times [2024-10-24 06:31:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:24,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795599213] [2024-10-24 06:31:24,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:24,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:24,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795599213] [2024-10-24 06:31:24,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795599213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:24,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:24,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:31:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358555058] [2024-10-24 06:31:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:24,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:31:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:31:24,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:31:24,399 INFO L87 Difference]: Start difference. First operand 468 states and 693 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:24,480 INFO L93 Difference]: Finished difference Result 878 states and 1296 transitions. [2024-10-24 06:31:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:31:24,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-10-24 06:31:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:24,485 INFO L225 Difference]: With dead ends: 878 [2024-10-24 06:31:24,485 INFO L226 Difference]: Without dead ends: 470 [2024-10-24 06:31:24,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:31:24,488 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:24,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:31:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-24 06:31:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2024-10-24 06:31:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 322 states have (on average 1.2826086956521738) internal successors, (413), 323 states have internal predecessors, (413), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-24 06:31:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 693 transitions. [2024-10-24 06:31:24,577 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 693 transitions. Word has length 225 [2024-10-24 06:31:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:24,578 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 693 transitions. [2024-10-24 06:31:24,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 693 transitions. [2024-10-24 06:31:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 06:31:24,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:24,581 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:24,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 06:31:24,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:24,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:24,582 INFO L85 PathProgramCache]: Analyzing trace with hash 502082582, now seen corresponding path program 1 times [2024-10-24 06:31:24,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:24,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003561520] [2024-10-24 06:31:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:24,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003561520] [2024-10-24 06:31:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003561520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:24,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:24,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:31:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407389151] [2024-10-24 06:31:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:24,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:31:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:31:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:31:24,971 INFO L87 Difference]: Start difference. First operand 470 states and 693 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:25,803 INFO L93 Difference]: Finished difference Result 1135 states and 1653 transitions. [2024-10-24 06:31:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 06:31:25,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-10-24 06:31:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:25,810 INFO L225 Difference]: With dead ends: 1135 [2024-10-24 06:31:25,811 INFO L226 Difference]: Without dead ends: 991 [2024-10-24 06:31:25,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 06:31:25,813 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 354 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:25,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 730 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 06:31:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-10-24 06:31:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 761. [2024-10-24 06:31:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 539 states have (on average 1.2912801484230056) internal successors, (696), 540 states have internal predecessors, (696), 210 states have call successors, (210), 11 states have call predecessors, (210), 11 states have return successors, (210), 209 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-24 06:31:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1116 transitions. [2024-10-24 06:31:26,028 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1116 transitions. Word has length 225 [2024-10-24 06:31:26,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:26,029 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1116 transitions. [2024-10-24 06:31:26,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1116 transitions. [2024-10-24 06:31:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 06:31:26,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:26,032 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:26,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 06:31:26,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:26,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:26,033 INFO L85 PathProgramCache]: Analyzing trace with hash -641588516, now seen corresponding path program 1 times [2024-10-24 06:31:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536296436] [2024-10-24 06:31:26,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:26,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:31:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:31:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:31:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:31:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:31:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:31:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:31:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:31:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:31:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:31:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:31:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:31:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:31:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:31:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:31:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:31:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:31:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:31:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:31:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:31:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:31:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:31:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:31:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:31:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:31:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:31:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:31:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 06:31:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:31:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 06:31:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:31:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 06:31:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 06:31:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:31:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 06:31:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:33,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:31:33,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536296436] [2024-10-24 06:31:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536296436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:33,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:33,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 06:31:33,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617302100] [2024-10-24 06:31:33,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:33,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 06:31:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:31:33,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 06:31:33,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:31:33,172 INFO L87 Difference]: Start difference. First operand 761 states and 1116 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:35,643 INFO L93 Difference]: Finished difference Result 1469 states and 2090 transitions. [2024-10-24 06:31:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 06:31:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-10-24 06:31:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:35,654 INFO L225 Difference]: With dead ends: 1469 [2024-10-24 06:31:35,655 INFO L226 Difference]: Without dead ends: 1197 [2024-10-24 06:31:35,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-24 06:31:35,659 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 203 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:35,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 769 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 06:31:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-10-24 06:31:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1126. [2024-10-24 06:31:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 889 states have (on average 1.3003374578177729) internal successors, (1156), 895 states have internal predecessors, (1156), 220 states have call successors, (220), 16 states have call predecessors, (220), 16 states have return successors, (220), 214 states have call predecessors, (220), 220 states have call successors, (220) [2024-10-24 06:31:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1596 transitions. [2024-10-24 06:31:35,841 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1596 transitions. Word has length 225 [2024-10-24 06:31:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:35,842 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1596 transitions. [2024-10-24 06:31:35,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1596 transitions. [2024-10-24 06:31:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 06:31:35,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:35,845 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 06:31:35,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:35,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:35,847 INFO L85 PathProgramCache]: Analyzing trace with hash -422733798, now seen corresponding path program 1 times [2024-10-24 06:31:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:31:35,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905401467] [2024-10-24 06:31:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:31:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:31:35,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:31:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:31:36,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:31:36,115 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:31:36,117 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:31:36,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 06:31:36,121 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:31:36,294 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:31:36,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:31:36 BoogieIcfgContainer [2024-10-24 06:31:36,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:31:36,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:31:36,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:31:36,299 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:31:36,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:31:17" (3/4) ... [2024-10-24 06:31:36,302 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:31:36,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:31:36,303 INFO L158 Benchmark]: Toolchain (without parser) took 20455.48ms. Allocated memory was 125.8MB in the beginning and 448.8MB in the end (delta: 323.0MB). Free memory was 58.4MB in the beginning and 214.7MB in the end (delta: -156.3MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. [2024-10-24 06:31:36,304 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:31:36,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.56ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 58.1MB in the beginning and 134.2MB in the end (delta: -76.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-10-24 06:31:36,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.22ms. Allocated memory is still 165.7MB. Free memory was 134.2MB in the beginning and 130.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:31:36,305 INFO L158 Benchmark]: Boogie Preprocessor took 68.25ms. Allocated memory is still 165.7MB. Free memory was 129.0MB in the beginning and 122.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 06:31:36,305 INFO L158 Benchmark]: RCFGBuilder took 780.41ms. Allocated memory is still 165.7MB. Free memory was 122.7MB in the beginning and 89.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 06:31:36,306 INFO L158 Benchmark]: TraceAbstraction took 19028.09ms. Allocated memory was 165.7MB in the beginning and 448.8MB in the end (delta: 283.1MB). Free memory was 88.1MB in the beginning and 214.7MB in the end (delta: -126.6MB). Peak memory consumption was 156.5MB. Max. memory is 16.1GB. [2024-10-24 06:31:36,306 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 448.8MB. Free memory is still 214.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:31:36,308 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.19ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.56ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 58.1MB in the beginning and 134.2MB in the end (delta: -76.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.22ms. Allocated memory is still 165.7MB. Free memory was 134.2MB in the beginning and 130.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.25ms. Allocated memory is still 165.7MB. Free memory was 129.0MB in the beginning and 122.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 780.41ms. Allocated memory is still 165.7MB. Free memory was 122.7MB in the beginning and 89.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19028.09ms. Allocated memory was 165.7MB in the beginning and 448.8MB in the end (delta: 283.1MB). Free memory was 88.1MB in the beginning and 214.7MB in the end (delta: -126.6MB). Peak memory consumption was 156.5MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 448.8MB. Free memory is still 214.7MB. 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 195. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] signed short int var_1_25 = -100; [L41] unsigned long int var_1_26 = 32; [L42] unsigned char var_1_27 = 1; [L43] unsigned long int var_1_28 = 100; [L44] unsigned long int var_1_29 = 1000000000; [L45] unsigned long int var_1_30 = 1000000000; [L46] unsigned long int var_1_31 = 10; [L47] unsigned long int var_1_32 = 10000; [L48] unsigned long int var_1_33 = 0; [L49] signed long int var_1_34 = -10; [L50] signed char var_1_35 = 25; [L51] signed char var_1_36 = -2; [L52] unsigned long int var_1_37 = 32; [L53] float var_1_38 = 4.6; [L54] float var_1_39 = 25.5; [L55] float var_1_40 = 99.25; [L56] signed long int last_1_var_1_5 = 5; [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L192] last_1_var_1_5 = var_1_5 [L202] RET updateLastVariables() [L203] CALL updateVariables() [L135] var_1_9 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L136] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L137] var_1_10 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L141] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L141] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L144] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L144] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L150] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L151] var_1_18 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L153] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L154] var_1_19 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L156] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L157] var_1_23 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L160] var_1_25 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L162] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L163] var_1_27 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L165] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L165] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L166] var_1_28 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L167] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L168] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L169] var_1_29 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_29 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L170] RET assume_abort_if_not(var_1_29 >= 536870911) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_29 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L171] RET assume_abort_if_not(var_1_29 <= 1073741824) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L172] var_1_30 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_30 >= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L173] RET assume_abort_if_not(var_1_30 >= 536870912) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_30 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L174] RET assume_abort_if_not(var_1_30 <= 1073741823) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L175] var_1_31 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L176] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_31 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L177] RET assume_abort_if_not(var_1_31 <= 1073741823) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L178] var_1_32 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L179] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L180] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L180] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L181] var_1_36 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_36 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L182] RET assume_abort_if_not(var_1_36 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L183] CALL assume_abort_if_not(var_1_36 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L183] RET assume_abort_if_not(var_1_36 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L184] var_1_38 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_38 >= -922337.2036854776000e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L185] RET assume_abort_if_not((var_1_38 >= -922337.2036854776000e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L186] var_1_39 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L187] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L188] var_1_40 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L189] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L203] RET updateVariables() [L204] CALL step() [L60] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L61] COND TRUE var_1_24 <= var_1_25 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L62] COND TRUE \read(var_1_27) [L63] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L70] COND FALSE !(var_1_32 != var_1_29) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L75] COND TRUE ((((((((10) < 0 ) ? -(10) : (10)))) > (var_1_24)) ? (((((10) < 0 ) ? -(10) : (10)))) : (var_1_24))) == var_1_25 [L76] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=25, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L78] COND TRUE \read(var_1_27) [L79] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L81] COND FALSE !((var_1_38 * var_1_39) <= var_1_40) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L86] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L89] var_1_20 = var_1_8 [L90] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L91] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L94] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L95] COND FALSE !(\read(var_1_22)) [L102] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L104] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L105] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L106] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L107] COND FALSE !(\read(var_1_22)) [L114] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L119] signed long int stepLocal_4 = 256; [L120] unsigned char stepLocal_3 = var_1_22; [L121] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L122] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=5, var_1_8=0] [L125] COND FALSE !(stepLocal_3 || var_1_22) [L130] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=-10000, var_1_8=0] [L204] RET step() [L205] CALL, EXPR property() [L195] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195-L196] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=32766, var_1_25=32766, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=536870912, var_1_31=1073741823, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=0, var_1_36=0, var_1_37=32, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 11, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1750 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1750 mSDsluCounter, 5830 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3461 mSDsCounter, 540 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1459 IncrementalHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 540 mSolverCounterUnsat, 2369 mSDtfsCounter, 1459 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 801 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1126occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 616 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 2436 NumberOfCodeBlocks, 2436 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2201 ConstructedInterpolants, 0 QuantifiedInterpolants, 11891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 23800/23800 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:31:36,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.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 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:31:38,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:31:38,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:31:38,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:31:38,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:31:38,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:31:38,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:31:38,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:31:39,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:31:39,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:31:39,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:31:39,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:31:39,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:31:39,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:31:39,005 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:31:39,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:31:39,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:31:39,006 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:31:39,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:31:39,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:31:39,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:31:39,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:31:39,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:31:39,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:31:39,012 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:31:39,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:31:39,013 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:31:39,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:31:39,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:31:39,013 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:31:39,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:31:39,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:31:39,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:31:39,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:31:39,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:31:39,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:31:39,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:31:39,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:31:39,018 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:31:39,018 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:31:39,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:31:39,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:31:39,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:31:39,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:31:39,020 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:31:39,021 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 -> 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 [2024-10-24 06:31:39,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:31:39,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:31:39,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:31:39,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:31:39,457 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:31:39,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-24 06:31:41,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:31:41,489 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:31:41,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-24 06:31:41,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95921950/7d849551687649dd96f973691353dfb9/FLAG52807e422 [2024-10-24 06:31:41,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95921950/7d849551687649dd96f973691353dfb9 [2024-10-24 06:31:41,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:31:41,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:31:41,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:31:41,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:31:41,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:31:41,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:41,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2228677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41, skipping insertion in model container [2024-10-24 06:31:41,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:41,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:31:41,778 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-25_file-97.i[915,928] [2024-10-24 06:31:41,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:31:41,888 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:31:41,901 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-25_file-97.i[915,928] [2024-10-24 06:31:41,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:31:41,991 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:31:41,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41 WrapperNode [2024-10-24 06:31:41,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:31:41,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:31:41,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:31:41,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:31:42,000 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:31:41" (1/1) ... [2024-10-24 06:31:42,027 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:31:41" (1/1) ... [2024-10-24 06:31:42,113 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-24 06:31:42,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:31:42,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:31:42,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:31:42,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:31:42,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,154 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:31:42,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:31:42,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:31:42,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:31:42,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:31:42,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (1/1) ... [2024-10-24 06:31:42,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:31:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:31:42,224 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:31:42,232 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:31:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:31:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:31:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:31:42,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:31:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:31:42,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:31:42,394 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:31:42,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:31:43,254 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 06:31:43,254 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:31:43,315 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:31:43,315 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:31:43,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:31:43 BoogieIcfgContainer [2024-10-24 06:31:43,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:31:43,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:31:43,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:31:43,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:31:43,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:31:41" (1/3) ... [2024-10-24 06:31:43,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e21300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:31:43, skipping insertion in model container [2024-10-24 06:31:43,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:31:41" (2/3) ... [2024-10-24 06:31:43,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e21300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:31:43, skipping insertion in model container [2024-10-24 06:31:43,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:31:43" (3/3) ... [2024-10-24 06:31:43,329 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-24 06:31:43,349 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:31:43,349 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:31:43,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:31:43,435 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;@63133e5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:31:43,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:31:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 06:31:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 06:31:43,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:43,464 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:43,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:43,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1381107390, now seen corresponding path program 1 times [2024-10-24 06:31:43,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:31:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477526483] [2024-10-24 06:31:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:43,491 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:31:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:31:43,516 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:31:43,519 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:31:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:43,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:31:43,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:31:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:44,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:31:44,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:31:44,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477526483] [2024-10-24 06:31:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477526483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:44,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:44,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:31:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732675453] [2024-10-24 06:31:44,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:44,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:31:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:31:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:31:44,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:31:44,062 INFO L87 Difference]: Start difference. First operand has 90 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:44,209 INFO L93 Difference]: Finished difference Result 207 states and 387 transitions. [2024-10-24 06:31:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:31:44,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 214 [2024-10-24 06:31:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:44,225 INFO L225 Difference]: With dead ends: 207 [2024-10-24 06:31:44,226 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 06:31:44,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:31:44,240 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 88 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:44,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 266 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:31:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 06:31:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-24 06:31:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 64 states have internal predecessors, (81), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 06:31:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2024-10-24 06:31:44,326 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 214 [2024-10-24 06:31:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:44,332 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2024-10-24 06:31:44,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2024-10-24 06:31:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 06:31:44,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:44,339 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:44,353 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:31:44,540 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:31:44,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:44,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1579106499, now seen corresponding path program 1 times [2024-10-24 06:31:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:31:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907664620] [2024-10-24 06:31:44,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:44,543 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:31:44,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:31:44,547 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:31:44,549 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:31:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:44,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:31:44,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:31:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1204 proven. 57 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2024-10-24 06:31:45,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:31:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 45 proven. 57 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-24 06:31:45,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:31:45,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907664620] [2024-10-24 06:31:45,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907664620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:31:45,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:31:45,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-24 06:31:45,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95765406] [2024-10-24 06:31:45,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:31:45,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 06:31:45,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:31:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 06:31:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 06:31:45,731 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-24 06:31:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:46,481 INFO L93 Difference]: Finished difference Result 222 states and 334 transitions. [2024-10-24 06:31:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 06:31:46,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 215 [2024-10-24 06:31:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:46,491 INFO L225 Difference]: With dead ends: 222 [2024-10-24 06:31:46,491 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 06:31:46,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-24 06:31:46,494 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 184 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:46,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 185 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 06:31:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 06:31:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2024-10-24 06:31:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 06:31:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2024-10-24 06:31:46,532 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 215 [2024-10-24 06:31:46,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:46,534 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2024-10-24 06:31:46,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-24 06:31:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2024-10-24 06:31:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 06:31:46,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:46,545 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:46,559 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:31:46,745 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:31:46,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:46,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1186079489, now seen corresponding path program 1 times [2024-10-24 06:31:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:31:46,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570810556] [2024-10-24 06:31:46,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:46,748 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:31:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:31:46,750 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:31:46,752 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:31:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:47,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:31:47,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:31:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:47,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:31:47,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:31:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570810556] [2024-10-24 06:31:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570810556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:47,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:31:47,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93738995] [2024-10-24 06:31:47,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:47,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:31:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:31:47,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:31:47,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:31:47,557 INFO L87 Difference]: Start difference. First operand 116 states and 174 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:48,095 INFO L93 Difference]: Finished difference Result 261 states and 390 transitions. [2024-10-24 06:31:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:31:48,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 215 [2024-10-24 06:31:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:48,101 INFO L225 Difference]: With dead ends: 261 [2024-10-24 06:31:48,102 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 06:31:48,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 211 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:31:48,104 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 151 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:48,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 502 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:31:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 06:31:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2024-10-24 06:31:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 82 states have internal predecessors, (93), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 06:31:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2024-10-24 06:31:48,140 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 215 [2024-10-24 06:31:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:48,144 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2024-10-24 06:31:48,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2024-10-24 06:31:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-24 06:31:48,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:48,148 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 06:31:48,349 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:31:48,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:48,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1575728501, now seen corresponding path program 1 times [2024-10-24 06:31:48,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:31:48,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357452802] [2024-10-24 06:31:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:48,352 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:31:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:31:48,355 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:31:48,356 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:31:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:48,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:31:48,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:31:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-24 06:31:50,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:31:50,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:31:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357452802] [2024-10-24 06:31:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357452802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:31:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:31:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:31:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593502695] [2024-10-24 06:31:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:31:50,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:31:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:31:50,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:31:50,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:31:50,030 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:31:50,532 INFO L93 Difference]: Finished difference Result 349 states and 511 transitions. [2024-10-24 06:31:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:31:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 216 [2024-10-24 06:31:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:31:50,537 INFO L225 Difference]: With dead ends: 349 [2024-10-24 06:31:50,538 INFO L226 Difference]: Without dead ends: 256 [2024-10-24 06:31:50,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:31:50,540 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 77 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:31:50,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 422 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:31:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-24 06:31:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 248. [2024-10-24 06:31:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 134 states have (on average 1.171641791044776) internal successors, (157), 135 states have internal predecessors, (157), 105 states have call successors, (105), 8 states have call predecessors, (105), 8 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 06:31:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 367 transitions. [2024-10-24 06:31:50,602 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 367 transitions. Word has length 216 [2024-10-24 06:31:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:31:50,603 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 367 transitions. [2024-10-24 06:31:50,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-24 06:31:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 367 transitions. [2024-10-24 06:31:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-24 06:31:50,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:31:50,607 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:50,622 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:31:50,807 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:31:50,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:31:50,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:31:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1604129982, now seen corresponding path program 1 times [2024-10-24 06:31:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:31:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437287184] [2024-10-24 06:31:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:31:50,811 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:31:50,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:31:50,816 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:31:50,818 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:31:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:31:51,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 06:31:51,373 INFO L278 TraceCheckSpWp]: Computing forward predicates...