./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-84cfde4 [2024-10-11 08:32:16,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:32:16,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:32:16,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:32:16,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:32:16,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:32:16,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:32:16,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:32:16,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:32:16,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:32:16,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:32:16,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:32:16,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:32:16,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:32:16,975 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:32:16,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:32:16,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:32:16,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:32:16,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:32:16,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:32:16,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:32:16,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:32:16,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:32:16,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:32:16,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:32:16,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:32:16,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:32:16,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:32:16,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:32:16,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:32:16,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:32:16,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:32:16,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:32:16,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:32:16,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:32:16,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:32:16,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:32:16,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:32:16,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:32:16,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:32:16,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:32:16,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:32:16,984 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-clean/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-clean/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-11 08:32:17,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:32:17,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:32:17,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:32:17,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:32:17,314 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:32:17,315 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-11 08:32:18,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:32:19,156 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:32:19,157 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-11 08:32:19,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe5971727/68d59598eace4f0f9442e4c4b41e0322/FLAG05435e951 [2024-10-11 08:32:19,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe5971727/68d59598eace4f0f9442e4c4b41e0322 [2024-10-11 08:32:19,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:32:19,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:32:19,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:32:19,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:32:19,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:32:19,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:19,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e74e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19, skipping insertion in model container [2024-10-11 08:32:19,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:19,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:32:19,751 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-11 08:32:19,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:32:19,841 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:32:19,852 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-11 08:32:19,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:32:19,908 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:32:19,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19 WrapperNode [2024-10-11 08:32:19,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:32:19,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:32:19,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:32:19,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:32:19,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:19,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:19,983 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 276 [2024-10-11 08:32:19,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:32:19,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:32:19,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:32:19,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:32:20,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,032 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-11 08:32:20,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:32:20,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:32:20,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:32:20,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:32:20,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (1/1) ... [2024-10-11 08:32:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:32:20,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:32:20,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:32:20,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:32:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:32:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:32:20,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:32:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:32:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:32:20,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:32:20,236 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:32:20,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:32:20,738 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-11 08:32:20,738 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:32:20,781 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:32:20,781 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:32:20,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:32:20 BoogieIcfgContainer [2024-10-11 08:32:20,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:32:20,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:32:20,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:32:20,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:32:20,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:32:19" (1/3) ... [2024-10-11 08:32:20,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80f3775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:32:20, skipping insertion in model container [2024-10-11 08:32:20,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:19" (2/3) ... [2024-10-11 08:32:20,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80f3775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:32:20, skipping insertion in model container [2024-10-11 08:32:20,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:32:20" (3/3) ... [2024-10-11 08:32:20,791 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-11 08:32:20,831 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:32:20,831 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:32:20,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:32:20,940 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;@5693860d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:32:20,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:32:20,946 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-11 08:32:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 08:32:20,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:20,964 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-11 08:32:20,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:20,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1881038183, now seen corresponding path program 1 times [2024-10-11 08:32:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615709926] [2024-10-11 08:32:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:21,608 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-11 08:32:21,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:21,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615709926] [2024-10-11 08:32:21,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615709926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:21,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:32:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053615706] [2024-10-11 08:32:21,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:21,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:32:21,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:21,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:32:21,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:32:21,649 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-11 08:32:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:21,695 INFO L93 Difference]: Finished difference Result 225 states and 397 transitions. [2024-10-11 08:32:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:32:21,699 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-11 08:32:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:21,711 INFO L225 Difference]: With dead ends: 225 [2024-10-11 08:32:21,711 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 08:32:21,717 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-11 08:32:21,724 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-11 08:32:21,725 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-11 08:32:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 08:32:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 08:32:21,782 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-11 08:32:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 177 transitions. [2024-10-11 08:32:21,787 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 177 transitions. Word has length 218 [2024-10-11 08:32:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:21,788 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 177 transitions. [2024-10-11 08:32:21,788 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-11 08:32:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 177 transitions. [2024-10-11 08:32:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 08:32:21,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:21,794 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-11 08:32:21,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:32:21,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:21,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1022041691, now seen corresponding path program 1 times [2024-10-11 08:32:21,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:21,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845990168] [2024-10-11 08:32:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,225 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-11 08:32:22,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:22,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845990168] [2024-10-11 08:32:22,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845990168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:22,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:22,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:32:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288584669] [2024-10-11 08:32:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:22,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:32:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:32:22,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:32:22,237 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-11 08:32:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:22,314 INFO L93 Difference]: Finished difference Result 253 states and 398 transitions. [2024-10-11 08:32:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:32:22,315 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-11 08:32:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:22,319 INFO L225 Difference]: With dead ends: 253 [2024-10-11 08:32:22,320 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 08:32:22,322 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-11 08:32:22,326 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-11 08:32:22,327 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-11 08:32:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 08:32:22,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-10-11 08:32:22,360 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-11 08:32:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 220 transitions. [2024-10-11 08:32:22,368 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 220 transitions. Word has length 218 [2024-10-11 08:32:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:22,369 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 220 transitions. [2024-10-11 08:32:22,369 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-11 08:32:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 220 transitions. [2024-10-11 08:32:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 08:32:22,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:22,376 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-11 08:32:22,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:32:22,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:22,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:22,381 INFO L85 PathProgramCache]: Analyzing trace with hash 728968384, now seen corresponding path program 1 times [2024-10-11 08:32:22,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:22,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405591071] [2024-10-11 08:32:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:22,674 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-11 08:32:22,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:22,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405591071] [2024-10-11 08:32:22,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405591071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:22,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:22,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:32:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442085496] [2024-10-11 08:32:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:22,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:32:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:22,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:32:22,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:32:22,681 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-11 08:32:22,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:22,804 INFO L93 Difference]: Finished difference Result 357 states and 553 transitions. [2024-10-11 08:32:22,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:32:22,805 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-11 08:32:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:22,810 INFO L225 Difference]: With dead ends: 357 [2024-10-11 08:32:22,810 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 08:32:22,811 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-11 08:32:22,812 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:32:22,813 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.1s Time] [2024-10-11 08:32:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 08:32:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2024-10-11 08:32:22,857 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-11 08:32:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 350 transitions. [2024-10-11 08:32:22,861 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 350 transitions. Word has length 219 [2024-10-11 08:32:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:22,862 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 350 transitions. [2024-10-11 08:32:22,862 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-11 08:32:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 350 transitions. [2024-10-11 08:32:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 08:32:22,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:22,865 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-11 08:32:22,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:32:22,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:22,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash -282148866, now seen corresponding path program 1 times [2024-10-11 08:32:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:22,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892937542] [2024-10-11 08:32:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:23,437 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-11 08:32:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892937542] [2024-10-11 08:32:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892937542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:23,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:23,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:32:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994156329] [2024-10-11 08:32:23,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:23,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:32:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:23,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:32:23,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:32:23,442 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-11 08:32:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:23,929 INFO L93 Difference]: Finished difference Result 674 states and 1029 transitions. [2024-10-11 08:32:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:32:23,931 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-11 08:32:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:23,939 INFO L225 Difference]: With dead ends: 674 [2024-10-11 08:32:23,941 INFO L226 Difference]: Without dead ends: 471 [2024-10-11 08:32:23,943 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-11 08:32:23,944 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-11 08:32:23,947 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-11 08:32:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-10-11 08:32:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 324. [2024-10-11 08:32:24,012 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-11 08:32:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 495 transitions. [2024-10-11 08:32:24,015 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 495 transitions. Word has length 219 [2024-10-11 08:32:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:24,016 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 495 transitions. [2024-10-11 08:32:24,016 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-11 08:32:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 495 transitions. [2024-10-11 08:32:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 08:32:24,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:24,019 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-11 08:32:24,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:32:24,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:24,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:24,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1184047692, now seen corresponding path program 1 times [2024-10-11 08:32:24,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:24,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556908115] [2024-10-11 08:32:24,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:24,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:24,779 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-11 08:32:24,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556908115] [2024-10-11 08:32:24,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556908115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:24,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:24,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 08:32:24,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201996682] [2024-10-11 08:32:24,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:24,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:32:24,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:24,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:32:24,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:32:24,785 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-11 08:32:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:25,404 INFO L93 Difference]: Finished difference Result 749 states and 1132 transitions. [2024-10-11 08:32:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:32:25,405 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-11 08:32:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:25,409 INFO L225 Difference]: With dead ends: 749 [2024-10-11 08:32:25,409 INFO L226 Difference]: Without dead ends: 485 [2024-10-11 08:32:25,410 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-11 08:32:25,412 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-11 08:32:25,414 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-11 08:32:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-11 08:32:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 462. [2024-10-11 08:32:25,487 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-11 08:32:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 692 transitions. [2024-10-11 08:32:25,491 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 692 transitions. Word has length 220 [2024-10-11 08:32:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:25,492 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 692 transitions. [2024-10-11 08:32:25,493 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-11 08:32:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 692 transitions. [2024-10-11 08:32:25,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 08:32:25,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:25,496 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-11 08:32:25,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:32:25,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:25,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1431479128, now seen corresponding path program 1 times [2024-10-11 08:32:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959163139] [2024-10-11 08:32:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:25,914 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-11 08:32:25,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959163139] [2024-10-11 08:32:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959163139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:32:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369830020] [2024-10-11 08:32:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:25,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:32:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:25,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:32:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:32:25,916 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-11 08:32:26,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:26,441 INFO L93 Difference]: Finished difference Result 724 states and 1090 transitions. [2024-10-11 08:32:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 08:32:26,441 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-11 08:32:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:26,446 INFO L225 Difference]: With dead ends: 724 [2024-10-11 08:32:26,446 INFO L226 Difference]: Without dead ends: 588 [2024-10-11 08:32:26,447 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-11 08:32:26,448 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-11 08:32:26,448 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-11 08:32:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-11 08:32:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 468. [2024-10-11 08:32:26,543 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-11 08:32:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 701 transitions. [2024-10-11 08:32:26,547 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 701 transitions. Word has length 221 [2024-10-11 08:32:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:26,551 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 701 transitions. [2024-10-11 08:32:26,551 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-11 08:32:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2024-10-11 08:32:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 08:32:26,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:26,553 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-11 08:32:26,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:32:26,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:26,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash 725024691, now seen corresponding path program 1 times [2024-10-11 08:32:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:26,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834169260] [2024-10-11 08:32:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,084 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-11 08:32:27,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:27,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834169260] [2024-10-11 08:32:27,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834169260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:27,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:27,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:32:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741911523] [2024-10-11 08:32:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:32:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:27,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:32:27,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:32:27,087 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-11 08:32:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:27,229 INFO L93 Difference]: Finished difference Result 887 states and 1327 transitions. [2024-10-11 08:32:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:32:27,229 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-11 08:32:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:27,233 INFO L225 Difference]: With dead ends: 887 [2024-10-11 08:32:27,233 INFO L226 Difference]: Without dead ends: 479 [2024-10-11 08:32:27,235 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-11 08:32:27,236 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-11 08:32:27,236 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-11 08:32:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-11 08:32:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 468. [2024-10-11 08:32:27,336 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-11 08:32:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 693 transitions. [2024-10-11 08:32:27,341 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 693 transitions. Word has length 221 [2024-10-11 08:32:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:27,341 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 693 transitions. [2024-10-11 08:32:27,342 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-11 08:32:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 693 transitions. [2024-10-11 08:32:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 08:32:27,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:27,344 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-11 08:32:27,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 08:32:27,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:27,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1523150936, now seen corresponding path program 1 times [2024-10-11 08:32:27,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:27,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727560734] [2024-10-11 08:32:27,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:27,641 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-11 08:32:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727560734] [2024-10-11 08:32:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727560734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:27,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:32:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625407450] [2024-10-11 08:32:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:27,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:32:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:27,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:32:27,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:32:27,644 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-11 08:32:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:27,755 INFO L93 Difference]: Finished difference Result 878 states and 1296 transitions. [2024-10-11 08:32:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:32:27,756 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-11 08:32:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:27,760 INFO L225 Difference]: With dead ends: 878 [2024-10-11 08:32:27,760 INFO L226 Difference]: Without dead ends: 470 [2024-10-11 08:32:27,761 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-11 08:32:27,762 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-11 08:32:27,763 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-11 08:32:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-11 08:32:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2024-10-11 08:32:27,880 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-11 08:32:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 693 transitions. [2024-10-11 08:32:27,884 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 693 transitions. Word has length 225 [2024-10-11 08:32:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:27,884 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 693 transitions. [2024-10-11 08:32:27,885 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-11 08:32:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 693 transitions. [2024-10-11 08:32:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 08:32:27,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:27,887 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-11 08:32:27,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 08:32:27,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:27,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash 502082582, now seen corresponding path program 1 times [2024-10-11 08:32:27,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:27,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006081322] [2024-10-11 08:32:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:27,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:28,273 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-11 08:32:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006081322] [2024-10-11 08:32:28,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006081322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:32:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485385632] [2024-10-11 08:32:28,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:28,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:32:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:32:28,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:32:28,276 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-11 08:32:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:29,204 INFO L93 Difference]: Finished difference Result 1135 states and 1653 transitions. [2024-10-11 08:32:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 08:32:29,205 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-11 08:32:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:29,211 INFO L225 Difference]: With dead ends: 1135 [2024-10-11 08:32:29,212 INFO L226 Difference]: Without dead ends: 991 [2024-10-11 08:32:29,213 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-11 08:32:29,215 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-11 08:32:29,215 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-11 08:32:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-10-11 08:32:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 761. [2024-10-11 08:32:29,409 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-11 08:32:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1116 transitions. [2024-10-11 08:32:29,418 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1116 transitions. Word has length 225 [2024-10-11 08:32:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:29,419 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1116 transitions. [2024-10-11 08:32:29,419 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-11 08:32:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1116 transitions. [2024-10-11 08:32:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 08:32:29,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:29,422 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-11 08:32:29,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 08:32:29,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:29,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash -641588516, now seen corresponding path program 1 times [2024-10-11 08:32:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136129121] [2024-10-11 08:32:29,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:32:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:32:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:32:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:32:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:32:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:32:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:32:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:32:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:32:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:32:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:32:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:32:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:32:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:32:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:32:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:32:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:32:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:32:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:32:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:32:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:32:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:32:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:32:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:32:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:32:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:32:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:32:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:32:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:32:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:32:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:32:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 08:32:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 08:32:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 08:32:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 08:32:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:43,116 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-11 08:32:43,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:32:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136129121] [2024-10-11 08:32:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136129121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:43,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:43,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 08:32:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483208938] [2024-10-11 08:32:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:43,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 08:32:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:32:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 08:32:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 08:32:43,120 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-11 08:32:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:47,531 INFO L93 Difference]: Finished difference Result 1469 states and 2090 transitions. [2024-10-11 08:32:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 08:32:47,533 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-11 08:32:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:47,542 INFO L225 Difference]: With dead ends: 1469 [2024-10-11 08:32:47,543 INFO L226 Difference]: Without dead ends: 1197 [2024-10-11 08:32:47,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-11 08:32:47,548 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 203 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:32:47,548 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.7s Time] [2024-10-11 08:32:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-10-11 08:32:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1126. [2024-10-11 08:32:47,759 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-11 08:32:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1596 transitions. [2024-10-11 08:32:47,767 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1596 transitions. Word has length 225 [2024-10-11 08:32:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:47,768 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1596 transitions. [2024-10-11 08:32:47,768 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-11 08:32:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1596 transitions. [2024-10-11 08:32:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 08:32:47,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:47,771 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-11 08:32:47,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 08:32:47,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:47,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash -422733798, now seen corresponding path program 1 times [2024-10-11 08:32:47,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:32:47,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019142078] [2024-10-11 08:32:47,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:32:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:32:47,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:32:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:32:48,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:32:48,056 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:32:48,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:32:48,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 08:32:48,063 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:32:48,243 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:32:48,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:32:48 BoogieIcfgContainer [2024-10-11 08:32:48,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:32:48,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:32:48,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:32:48,248 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:32:48,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:32:20" (3/4) ... [2024-10-11 08:32:48,251 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:32:48,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:32:48,253 INFO L158 Benchmark]: Toolchain (without parser) took 28731.87ms. Allocated memory was 163.6MB in the beginning and 432.0MB in the end (delta: 268.4MB). Free memory was 108.4MB in the beginning and 210.0MB in the end (delta: -101.6MB). Peak memory consumption was 169.2MB. Max. memory is 16.1GB. [2024-10-11 08:32:48,253 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 163.6MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:32:48,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.43ms. Allocated memory is still 163.6MB. Free memory was 108.4MB in the beginning and 91.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:32:48,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.50ms. Allocated memory is still 163.6MB. Free memory was 91.1MB in the beginning and 86.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:32:48,254 INFO L158 Benchmark]: Boogie Preprocessor took 92.61ms. Allocated memory is still 163.6MB. Free memory was 86.9MB in the beginning and 80.4MB in the end (delta: 6.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:32:48,254 INFO L158 Benchmark]: RCFGBuilder took 700.43ms. Allocated memory is still 163.6MB. Free memory was 80.4MB in the beginning and 46.2MB in the end (delta: 34.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 08:32:48,255 INFO L158 Benchmark]: TraceAbstraction took 27463.13ms. Allocated memory was 163.6MB in the beginning and 432.0MB in the end (delta: 268.4MB). Free memory was 45.6MB in the beginning and 210.0MB in the end (delta: -164.4MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. [2024-10-11 08:32:48,255 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 432.0MB. Free memory is still 210.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:32:48,256 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.22ms. Allocated memory is still 163.6MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.43ms. Allocated memory is still 163.6MB. Free memory was 108.4MB in the beginning and 91.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.50ms. Allocated memory is still 163.6MB. Free memory was 91.1MB in the beginning and 86.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.61ms. Allocated memory is still 163.6MB. Free memory was 86.9MB in the beginning and 80.4MB in the end (delta: 6.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 700.43ms. Allocated memory is still 163.6MB. Free memory was 80.4MB in the beginning and 46.2MB in the end (delta: 34.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27463.13ms. Allocated memory was 163.6MB in the beginning and 432.0MB in the end (delta: 268.4MB). Free memory was 45.6MB in the beginning and 210.0MB in the end (delta: -164.4MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 432.0MB. Free memory is still 210.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 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: 27.2s, OverallIterations: 11, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1750 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1750 mSDsluCounter, 5830 SdHoareTripleChecker+Invalid, 3.3s 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, 7.4s 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: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 616 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 2436 NumberOfCodeBlocks, 2436 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2201 ConstructedInterpolants, 0 QuantifiedInterpolants, 15302 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-11 08:32:48,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-84cfde4 [2024-10-11 08:32:50,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:32:50,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:32:50,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:32:50,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:32:50,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:32:50,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:32:50,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:32:50,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:32:50,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:32:50,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:32:50,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:32:50,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:32:50,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:32:50,987 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:32:50,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:32:50,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:32:50,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:32:50,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:32:50,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:32:50,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:32:50,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:32:50,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:32:50,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:32:50,994 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:32:50,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:32:50,995 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:32:50,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:32:50,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:32:50,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:32:50,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:32:50,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:32:50,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:32:50,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:32:50,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:32:50,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:32:50,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:32:50,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:32:50,998 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:32:50,998 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:32:50,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:32:51,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:32:51,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:32:51,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:32:51,001 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:32:51,001 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-clean/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-clean/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-11 08:32:51,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:32:51,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:32:51,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:32:51,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:32:51,438 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:32:51,441 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-11 08:32:53,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:32:53,397 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:32:53,398 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-11 08:32:53,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56b9ecbf4/26b5e519fdc2453b957d87c94ad37bea/FLAG4f55534ad [2024-10-11 08:32:53,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56b9ecbf4/26b5e519fdc2453b957d87c94ad37bea [2024-10-11 08:32:53,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:32:53,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:32:53,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:32:53,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:32:53,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:32:53,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:53,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ae2957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53, skipping insertion in model container [2024-10-11 08:32:53,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:53,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:32:53,684 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-11 08:32:53,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:32:53,801 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:32:53,818 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-11 08:32:53,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:32:53,890 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:32:53,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53 WrapperNode [2024-10-11 08:32:53,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:32:53,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:32:53,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:32:53,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:32:53,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:53,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:53,964 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-11 08:32:53,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:32:53,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:32:53,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:32:53,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:32:53,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:53,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:53,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:54,021 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-11 08:32:54,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:54,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:54,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:54,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:54,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:54,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:54,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:32:54,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:32:54,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:32:54,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:32:54,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (1/1) ... [2024-10-11 08:32:54,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:32:54,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:32:54,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:32:54,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:32:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:32:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:32:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:32:54,166 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:32:54,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:32:54,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:32:54,292 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:32:54,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:32:55,060 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 08:32:55,061 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:32:55,173 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:32:55,173 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:32:55,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:32:55 BoogieIcfgContainer [2024-10-11 08:32:55,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:32:55,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:32:55,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:32:55,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:32:55,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:32:53" (1/3) ... [2024-10-11 08:32:55,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53de028e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:32:55, skipping insertion in model container [2024-10-11 08:32:55,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:32:53" (2/3) ... [2024-10-11 08:32:55,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53de028e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:32:55, skipping insertion in model container [2024-10-11 08:32:55,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:32:55" (3/3) ... [2024-10-11 08:32:55,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2024-10-11 08:32:55,207 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:32:55,208 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:32:55,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:32:55,300 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;@bcae0d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:32:55,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:32:55,306 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-11 08:32:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 08:32:55,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:55,329 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-11 08:32:55,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1381107390, now seen corresponding path program 1 times [2024-10-11 08:32:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:32:55,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054384375] [2024-10-11 08:32:55,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:55,356 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-11 08:32:55,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:32:55,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 08:32:55,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:32:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:55,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:32:55,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:32:55,857 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-11 08:32:55,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:32:55,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:32:55,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054384375] [2024-10-11 08:32:55,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054384375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:55,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:55,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:32:55,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102042742] [2024-10-11 08:32:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:55,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:32:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:32:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:32:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:32:55,930 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-11 08:32:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:56,053 INFO L93 Difference]: Finished difference Result 207 states and 387 transitions. [2024-10-11 08:32:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:32:56,056 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-11 08:32:56,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:56,067 INFO L225 Difference]: With dead ends: 207 [2024-10-11 08:32:56,067 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 08:32:56,072 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-11 08:32:56,075 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 88 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-11 08:32:56,077 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-11 08:32:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 08:32:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-11 08:32:56,139 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-11 08:32:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2024-10-11 08:32:56,145 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 214 [2024-10-11 08:32:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:56,147 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2024-10-11 08:32:56,147 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-11 08:32:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2024-10-11 08:32:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:32:56,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:56,153 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-11 08:32:56,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:32:56,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 08:32:56,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:56,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:56,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1579106499, now seen corresponding path program 1 times [2024-10-11 08:32:56,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:32:56,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477942813] [2024-10-11 08:32:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:56,358 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-11 08:32:56,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:32:56,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 08:32:56,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:32:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:56,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:32:56,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:32:57,128 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-11 08:32:57,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:32:57,545 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-11 08:32:57,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:32:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477942813] [2024-10-11 08:32:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477942813] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:32:57,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:32:57,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 08:32:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838667397] [2024-10-11 08:32:57,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:32:57,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:32:57,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:32:57,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:32:57,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:32:57,551 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-11 08:32:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:58,298 INFO L93 Difference]: Finished difference Result 222 states and 334 transitions. [2024-10-11 08:32:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 08:32:58,302 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-11 08:32:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:58,311 INFO L225 Difference]: With dead ends: 222 [2024-10-11 08:32:58,312 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 08:32:58,313 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-11 08:32:58,314 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-11 08:32:58,315 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-11 08:32:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 08:32:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2024-10-11 08:32:58,342 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-11 08:32:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2024-10-11 08:32:58,347 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 215 [2024-10-11 08:32:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:58,350 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2024-10-11 08:32:58,350 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-11 08:32:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2024-10-11 08:32:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:32:58,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:58,358 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-11 08:32:58,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:32:58,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 08:32:58,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:32:58,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:32:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1186079489, now seen corresponding path program 1 times [2024-10-11 08:32:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:32:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494167396] [2024-10-11 08:32:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:32:58,562 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-11 08:32:58,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:32:58,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 08:32:58,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:32:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:32:58,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:32:58,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:32:59,357 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-11 08:32:59,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:32:59,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:32:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494167396] [2024-10-11 08:32:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494167396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:32:59,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:32:59,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:32:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291364180] [2024-10-11 08:32:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:32:59,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:32:59,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:32:59,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:32:59,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:32:59,361 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-11 08:32:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:32:59,818 INFO L93 Difference]: Finished difference Result 261 states and 390 transitions. [2024-10-11 08:32:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:32:59,819 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-11 08:32:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:32:59,823 INFO L225 Difference]: With dead ends: 261 [2024-10-11 08:32:59,824 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 08:32:59,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:32:59,829 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 151 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-11 08:32:59,829 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-11 08:32:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 08:32:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2024-10-11 08:32:59,881 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-11 08:32:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2024-10-11 08:32:59,883 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 215 [2024-10-11 08:32:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:32:59,884 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2024-10-11 08:32:59,885 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-11 08:32:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2024-10-11 08:32:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 08:32:59,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:32:59,888 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-11 08:32:59,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:33:00,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 08:33:00,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:33:00,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:33:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1575728501, now seen corresponding path program 1 times [2024-10-11 08:33:00,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:33:00,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164849630] [2024-10-11 08:33:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:33:00,092 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-11 08:33:00,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:33:00,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 08:33:00,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:33:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:33:00,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:33:00,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:33:01,431 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-11 08:33:01,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:33:01,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:33:01,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164849630] [2024-10-11 08:33:01,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164849630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:33:01,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:33:01,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:33:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845559187] [2024-10-11 08:33:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:33:01,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:33:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:33:01,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:33:01,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:33:01,438 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-11 08:33:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:33:01,871 INFO L93 Difference]: Finished difference Result 349 states and 511 transitions. [2024-10-11 08:33:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:33:01,872 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-11 08:33:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:33:01,875 INFO L225 Difference]: With dead ends: 349 [2024-10-11 08:33:01,875 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 08:33:01,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:33:01,877 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-11 08:33:01,877 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-11 08:33:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 08:33:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 248. [2024-10-11 08:33:01,952 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-11 08:33:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 367 transitions. [2024-10-11 08:33:01,956 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 367 transitions. Word has length 216 [2024-10-11 08:33:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:33:01,957 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 367 transitions. [2024-10-11 08:33:01,957 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-11 08:33:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 367 transitions. [2024-10-11 08:33:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 08:33:01,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:33:01,961 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-11 08:33:01,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 08:33:02,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 08:33:02,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:33:02,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:33:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1604129982, now seen corresponding path program 1 times [2024-10-11 08:33:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:33:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422999161] [2024-10-11 08:33:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:33:02,164 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-11 08:33:02,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:33:02,168 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 08:33:02,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:33:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:33:02,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 08:33:02,653 INFO L278 TraceCheckSpWp]: Computing forward predicates...