./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_loopvsstraightlinecode_100-while_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82b18cd242e9ca49d0125d9760f9ce4d46eda4589890d58c3d3555645b3c016 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:16:35,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:16:35,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:16:35,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:16:35,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:16:35,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:16:35,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:16:35,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:16:35,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:16:35,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:16:35,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:16:35,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:16:35,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:16:35,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:16:35,245 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:16:35,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:16:35,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:16:35,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:16:35,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:16:35,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:16:35,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:16:35,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:16:35,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:16:35,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:16:35,249 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:16:35,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:16:35,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:16:35,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:16:35,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:16:35,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:16:35,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:16:35,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:16:35,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:16:35,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:16:35,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:16:35,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:16:35,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:16:35,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:16:35,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:16:35,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:16:35,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:16:35,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:16:35,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82b18cd242e9ca49d0125d9760f9ce4d46eda4589890d58c3d3555645b3c016 [2024-10-24 09:16:35,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:16:35,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:16:35,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:16:35,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:16:35,563 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:16:35,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-24 09:16:37,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:16:37,297 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:16:37,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-24 09:16:37,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af970542/9d51bd49286545a09b3ab5ddfe5a64c3/FLAG824668f0e [2024-10-24 09:16:37,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af970542/9d51bd49286545a09b3ab5ddfe5a64c3 [2024-10-24 09:16:37,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:16:37,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:16:37,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:16:37,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:16:37,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:16:37,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5528f7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37, skipping insertion in model container [2024-10-24 09:16:37,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:16:37,564 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_loopvsstraightlinecode_100-while_file-43.i[916,929] [2024-10-24 09:16:37,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:16:37,678 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:16:37,689 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i[916,929] [2024-10-24 09:16:37,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:16:37,779 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:16:37,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37 WrapperNode [2024-10-24 09:16:37,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:16:37,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:16:37,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:16:37,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:16:37,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,852 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 280 [2024-10-24 09:16:37,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:16:37,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:16:37,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:16:37,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:16:37,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,909 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:16:37,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:37,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:16:37,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:16:37,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:16:37,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:16:37,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (1/1) ... [2024-10-24 09:16:38,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:16:38,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:16:38,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:16:38,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:16:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:16:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:16:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:16:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:16:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:16:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:16:38,220 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:16:38,223 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:16:38,874 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-24 09:16:38,874 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:16:38,913 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:16:38,914 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:16:38,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:16:38 BoogieIcfgContainer [2024-10-24 09:16:38,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:16:38,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:16:38,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:16:38,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:16:38,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:16:37" (1/3) ... [2024-10-24 09:16:38,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3942b2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:16:38, skipping insertion in model container [2024-10-24 09:16:38,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:37" (2/3) ... [2024-10-24 09:16:38,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3942b2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:16:38, skipping insertion in model container [2024-10-24 09:16:38,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:16:38" (3/3) ... [2024-10-24 09:16:38,926 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-24 09:16:38,944 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:16:38,944 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:16:39,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:16:39,026 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;@29fafc96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:16:39,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:16:39,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 82 states have internal predecessors, (120), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 09:16:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 09:16:39,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:39,053 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:39,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:39,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash -272031461, now seen corresponding path program 1 times [2024-10-24 09:16:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:39,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515562692] [2024-10-24 09:16:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:16:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:16:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:16:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:16:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:16:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:16:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:16:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:16:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:16:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:16:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:16:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:16:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:16:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:16:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:16:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:16:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:16:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:16:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:16:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 09:16:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:16:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 09:16:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:16:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 09:16:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:16:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 09:16:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:16:39,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:16:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515562692] [2024-10-24 09:16:39,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515562692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:16:39,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:16:39,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:16:39,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955024511] [2024-10-24 09:16:39,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:16:39,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:16:39,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:16:39,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:16:39,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:16:39,693 INFO L87 Difference]: Start difference. First operand has 110 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 82 states have internal predecessors, (120), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 09:16:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:16:39,743 INFO L93 Difference]: Finished difference Result 217 states and 368 transitions. [2024-10-24 09:16:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:16:39,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177 [2024-10-24 09:16:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:16:39,758 INFO L225 Difference]: With dead ends: 217 [2024-10-24 09:16:39,759 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 09:16:39,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:16:39,774 INFO L432 NwaCegarLoop]: 162 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, 162 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:16:39,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:16:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 09:16:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-24 09:16:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 09:16:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 165 transitions. [2024-10-24 09:16:39,835 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 165 transitions. Word has length 177 [2024-10-24 09:16:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:16:39,836 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 165 transitions. [2024-10-24 09:16:39,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 09:16:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 165 transitions. [2024-10-24 09:16:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 09:16:39,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:39,841 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:39,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:16:39,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:39,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash 465052327, now seen corresponding path program 1 times [2024-10-24 09:16:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:39,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498207035] [2024-10-24 09:16:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:39,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:16:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:16:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:16:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:16:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:16:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:16:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:16:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:16:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:16:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:16:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:16:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:16:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:16:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:16:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:16:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:16:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:16:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:16:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:16:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 09:16:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:16:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 09:16:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:16:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 09:16:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:16:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 09:16:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:16:40,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:16:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498207035] [2024-10-24 09:16:40,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498207035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:16:40,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:16:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:16:40,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093343174] [2024-10-24 09:16:40,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:16:40,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:16:40,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:16:40,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:16:40,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:16:40,657 INFO L87 Difference]: Start difference. First operand 108 states and 165 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:16:40,928 INFO L93 Difference]: Finished difference Result 323 states and 494 transitions. [2024-10-24 09:16:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:16:40,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-10-24 09:16:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:16:40,938 INFO L225 Difference]: With dead ends: 323 [2024-10-24 09:16:40,940 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 09:16:40,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:16:40,946 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 132 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:16:40,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 472 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:16:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 09:16:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 193. [2024-10-24 09:16:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 09:16:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 298 transitions. [2024-10-24 09:16:41,005 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 298 transitions. Word has length 177 [2024-10-24 09:16:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:16:41,010 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 298 transitions. [2024-10-24 09:16:41,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 298 transitions. [2024-10-24 09:16:41,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 09:16:41,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:41,014 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:41,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:16:41,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:41,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1755191647, now seen corresponding path program 1 times [2024-10-24 09:16:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:41,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260021418] [2024-10-24 09:16:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:41,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:16:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:16:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:16:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:16:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:16:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:16:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:16:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:16:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:16:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:16:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:16:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:16:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:16:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:16:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:16:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:16:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:16:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:16:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:16:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 09:16:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:16:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 09:16:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:16:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 09:16:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:16:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 09:16:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:16:41,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:16:41,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260021418] [2024-10-24 09:16:41,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260021418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:16:41,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:16:41,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:16:41,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406684336] [2024-10-24 09:16:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:16:41,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:16:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:16:41,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:16:41,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:16:41,464 INFO L87 Difference]: Start difference. First operand 193 states and 298 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:16:41,530 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2024-10-24 09:16:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:16:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2024-10-24 09:16:41,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:16:41,535 INFO L225 Difference]: With dead ends: 452 [2024-10-24 09:16:41,535 INFO L226 Difference]: Without dead ends: 324 [2024-10-24 09:16:41,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:16:41,539 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 159 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:16:41,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 407 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:16:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-24 09:16:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 197. [2024-10-24 09:16:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.3943661971830985) internal successors, (198), 142 states have internal predecessors, (198), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 09:16:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 302 transitions. [2024-10-24 09:16:41,575 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 302 transitions. Word has length 179 [2024-10-24 09:16:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:16:41,576 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 302 transitions. [2024-10-24 09:16:41,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 302 transitions. [2024-10-24 09:16:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-24 09:16:41,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:41,585 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:41,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:16:41,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:41,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1386249294, now seen corresponding path program 1 times [2024-10-24 09:16:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287632701] [2024-10-24 09:16:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:16:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:16:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:16:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:16:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:16:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:16:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:16:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:16:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:16:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:16:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:16:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:16:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:16:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:16:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:16:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:16:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:16:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:16:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:16:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 09:16:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:16:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 09:16:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:16:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 09:16:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:16:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 09:16:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:16:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:16:41,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287632701] [2024-10-24 09:16:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287632701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:16:41,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:16:41,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:16:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882244067] [2024-10-24 09:16:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:16:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:16:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:16:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:16:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:16:41,976 INFO L87 Difference]: Start difference. First operand 197 states and 302 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:16:42,178 INFO L93 Difference]: Finished difference Result 516 states and 791 transitions. [2024-10-24 09:16:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:16:42,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-10-24 09:16:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:16:42,183 INFO L225 Difference]: With dead ends: 516 [2024-10-24 09:16:42,185 INFO L226 Difference]: Without dead ends: 371 [2024-10-24 09:16:42,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:16:42,187 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 200 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:16:42,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 529 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:16:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-24 09:16:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 347. [2024-10-24 09:16:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 265 states have internal predecessors, (378), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-24 09:16:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 534 transitions. [2024-10-24 09:16:42,270 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 534 transitions. Word has length 180 [2024-10-24 09:16:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:16:42,271 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 534 transitions. [2024-10-24 09:16:42,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 534 transitions. [2024-10-24 09:16:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-24 09:16:42,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:42,279 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:42,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:16:42,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:42,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1383341391, now seen corresponding path program 1 times [2024-10-24 09:16:42,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:42,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528156605] [2024-10-24 09:16:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:16:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:16:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:16:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:16:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:16:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:16:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:16:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:16:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:16:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:16:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:16:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:16:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:16:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:16:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:16:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:16:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:16:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:16:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:16:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 09:16:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:16:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 09:16:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:16:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 09:16:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:16:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 09:16:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:16:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:16:42,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528156605] [2024-10-24 09:16:42,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528156605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:16:42,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:16:42,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:16:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506935105] [2024-10-24 09:16:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:16:42,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:16:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:16:42,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:16:42,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:16:42,832 INFO L87 Difference]: Start difference. First operand 347 states and 534 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:16:43,104 INFO L93 Difference]: Finished difference Result 775 states and 1178 transitions. [2024-10-24 09:16:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:16:43,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-10-24 09:16:43,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:16:43,108 INFO L225 Difference]: With dead ends: 775 [2024-10-24 09:16:43,110 INFO L226 Difference]: Without dead ends: 485 [2024-10-24 09:16:43,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:16:43,112 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 203 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:16:43,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 686 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:16:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-24 09:16:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 429. [2024-10-24 09:16:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 347 states have (on average 1.440922190201729) internal successors, (500), 347 states have internal predecessors, (500), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-24 09:16:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 656 transitions. [2024-10-24 09:16:43,160 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 656 transitions. Word has length 182 [2024-10-24 09:16:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:16:43,161 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 656 transitions. [2024-10-24 09:16:43,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 656 transitions. [2024-10-24 09:16:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-24 09:16:43,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:43,163 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:43,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:16:43,164 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:43,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1360709137, now seen corresponding path program 1 times [2024-10-24 09:16:43,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:43,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733031016] [2024-10-24 09:16:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:43,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:16:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:16:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:16:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:16:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:16:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:16:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:16:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:16:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:16:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:16:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:16:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:16:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:16:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:16:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:16:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:16:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:16:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:16:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:16:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 09:16:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:16:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 09:16:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:16:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 09:16:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:16:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 09:16:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:16:43,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:16:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733031016] [2024-10-24 09:16:43,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733031016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:16:43,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:16:43,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:16:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768279342] [2024-10-24 09:16:43,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:16:43,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:16:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:16:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:16:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:16:43,805 INFO L87 Difference]: Start difference. First operand 429 states and 656 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:16:44,035 INFO L93 Difference]: Finished difference Result 683 states and 1040 transitions. [2024-10-24 09:16:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:16:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-10-24 09:16:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:16:44,039 INFO L225 Difference]: With dead ends: 683 [2024-10-24 09:16:44,039 INFO L226 Difference]: Without dead ends: 393 [2024-10-24 09:16:44,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:16:44,041 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 118 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:16:44,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 452 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:16:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-24 09:16:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 375. [2024-10-24 09:16:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.4095563139931742) internal successors, (413), 293 states have internal predecessors, (413), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-24 09:16:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 569 transitions. [2024-10-24 09:16:44,083 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 569 transitions. Word has length 182 [2024-10-24 09:16:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:16:44,084 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 569 transitions. [2024-10-24 09:16:44,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 569 transitions. [2024-10-24 09:16:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 09:16:44,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:44,086 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:44,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:16:44,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:44,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1331540346, now seen corresponding path program 1 times [2024-10-24 09:16:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:44,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714967547] [2024-10-24 09:16:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:16:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:16:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:16:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:16:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:16:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:16:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:16:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:16:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:16:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:16:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:16:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:16:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:16:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:16:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:16:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:16:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:16:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:16:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:16:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 09:16:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:16:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 09:16:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:16:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 09:16:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:16:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 09:16:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:16:44,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:16:44,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714967547] [2024-10-24 09:16:44,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714967547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:16:44,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:16:44,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:16:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503580030] [2024-10-24 09:16:44,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:16:44,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:16:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:16:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:16:44,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:16:44,491 INFO L87 Difference]: Start difference. First operand 375 states and 569 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:16:44,711 INFO L93 Difference]: Finished difference Result 721 states and 1088 transitions. [2024-10-24 09:16:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:16:44,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2024-10-24 09:16:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:16:44,715 INFO L225 Difference]: With dead ends: 721 [2024-10-24 09:16:44,715 INFO L226 Difference]: Without dead ends: 399 [2024-10-24 09:16:44,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:16:44,717 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 196 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:16:44,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 744 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:16:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-24 09:16:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 375. [2024-10-24 09:16:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.4027303754266212) internal successors, (411), 293 states have internal predecessors, (411), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-24 09:16:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 567 transitions. [2024-10-24 09:16:44,772 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 567 transitions. Word has length 183 [2024-10-24 09:16:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:16:44,773 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 567 transitions. [2024-10-24 09:16:44,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 567 transitions. [2024-10-24 09:16:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 09:16:44,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:44,776 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:44,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 09:16:44,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:44,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:44,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2033140220, now seen corresponding path program 1 times [2024-10-24 09:16:44,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:44,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502690220] [2024-10-24 09:16:44,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:44,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:16:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:16:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:16:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:16:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:16:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:16:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:16:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:16:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:16:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:16:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:16:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:16:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:16:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:16:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:16:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:16:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:16:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:16:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:16:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 09:16:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:16:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 09:16:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:16:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 09:16:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:16:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 09:16:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:16:45,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:16:45,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502690220] [2024-10-24 09:16:45,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502690220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:16:45,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:16:45,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:16:45,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591446844] [2024-10-24 09:16:45,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:16:45,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:16:45,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:16:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:16:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:16:45,332 INFO L87 Difference]: Start difference. First operand 375 states and 567 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:16:45,591 INFO L93 Difference]: Finished difference Result 709 states and 1070 transitions. [2024-10-24 09:16:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:16:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2024-10-24 09:16:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:16:45,596 INFO L225 Difference]: With dead ends: 709 [2024-10-24 09:16:45,596 INFO L226 Difference]: Without dead ends: 391 [2024-10-24 09:16:45,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:16:45,598 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 112 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:16:45,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 456 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:16:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-24 09:16:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 377. [2024-10-24 09:16:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 295 states have (on average 1.3966101694915254) internal successors, (412), 295 states have internal predecessors, (412), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-24 09:16:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 568 transitions. [2024-10-24 09:16:45,648 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 568 transitions. Word has length 183 [2024-10-24 09:16:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:16:45,649 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 568 transitions. [2024-10-24 09:16:45,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:16:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 568 transitions. [2024-10-24 09:16:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 09:16:45,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:45,652 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:45,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 09:16:45,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:45,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:45,653 INFO L85 PathProgramCache]: Analyzing trace with hash -895921748, now seen corresponding path program 1 times [2024-10-24 09:16:45,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:45,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817493630] [2024-10-24 09:16:45,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:16:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:16:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:16:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:16:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:16:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:16:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:16:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:16:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:16:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:16:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:16:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:16:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:16:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:16:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:16:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:16:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:16:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:16:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:16:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 09:16:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:16:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 09:16:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:16:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 09:16:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:16:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 09:16:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:16:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:16:46,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:16:46,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817493630] [2024-10-24 09:16:46,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817493630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:16:46,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:16:46,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:16:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148075386] [2024-10-24 09:16:46,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:16:46,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:16:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:16:46,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:16:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:16:46,230 INFO L87 Difference]: Start difference. First operand 377 states and 568 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 09:16:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:16:46,578 INFO L93 Difference]: Finished difference Result 697 states and 1045 transitions. [2024-10-24 09:16:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:16:46,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 184 [2024-10-24 09:16:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:16:46,582 INFO L225 Difference]: With dead ends: 697 [2024-10-24 09:16:46,583 INFO L226 Difference]: Without dead ends: 389 [2024-10-24 09:16:46,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:16:46,586 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 230 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:16:46,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 738 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 09:16:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-24 09:16:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 375. [2024-10-24 09:16:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.3686006825938566) internal successors, (401), 293 states have internal predecessors, (401), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-24 09:16:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 557 transitions. [2024-10-24 09:16:46,631 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 557 transitions. Word has length 184 [2024-10-24 09:16:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:16:46,632 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 557 transitions. [2024-10-24 09:16:46,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 09:16:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 557 transitions. [2024-10-24 09:16:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 09:16:46,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:16:46,635 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:46,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 09:16:46,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:16:46,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:16:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1827602668, now seen corresponding path program 1 times [2024-10-24 09:16:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:16:46,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065233689] [2024-10-24 09:16:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:16:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:16:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:16:46,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:16:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:16:46,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:16:46,954 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:16:46,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:16:46,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 09:16:46,964 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:16:47,108 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:16:47,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:16:47 BoogieIcfgContainer [2024-10-24 09:16:47,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:16:47,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:16:47,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:16:47,113 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:16:47,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:16:38" (3/4) ... [2024-10-24 09:16:47,115 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:16:47,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:16:47,117 INFO L158 Benchmark]: Toolchain (without parser) took 9785.71ms. Allocated memory was 146.8MB in the beginning and 276.8MB in the end (delta: 130.0MB). Free memory was 91.7MB in the beginning and 153.7MB in the end (delta: -62.0MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2024-10-24 09:16:47,117 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:16:47,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.20ms. Allocated memory is still 146.8MB. Free memory was 91.7MB in the beginning and 73.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:16:47,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.78ms. Allocated memory is still 146.8MB. Free memory was 72.9MB in the beginning and 67.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:16:47,118 INFO L158 Benchmark]: Boogie Preprocessor took 132.39ms. Allocated memory is still 146.8MB. Free memory was 67.3MB in the beginning and 115.9MB in the end (delta: -48.5MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-10-24 09:16:47,119 INFO L158 Benchmark]: RCFGBuilder took 925.80ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 115.8MB in the beginning and 124.4MB in the end (delta: -8.6MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-10-24 09:16:47,119 INFO L158 Benchmark]: TraceAbstraction took 8195.01ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 123.4MB in the beginning and 153.7MB in the end (delta: -30.3MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-10-24 09:16:47,119 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 276.8MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:16:47,121 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.18ms. Allocated memory is still 146.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.20ms. Allocated memory is still 146.8MB. Free memory was 91.7MB in the beginning and 73.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.78ms. Allocated memory is still 146.8MB. Free memory was 72.9MB in the beginning and 67.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.39ms. Allocated memory is still 146.8MB. Free memory was 67.3MB in the beginning and 115.9MB in the end (delta: -48.5MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * RCFGBuilder took 925.80ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 115.8MB in the beginning and 124.4MB in the end (delta: -8.6MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8195.01ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 123.4MB in the beginning and 153.7MB in the end (delta: -30.3MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 276.8MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of bitwiseOr at line 64, overapproximation of bitwiseAnd at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 200. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 10; [L24] unsigned char var_1_5 = 4; [L25] unsigned char var_1_6 = 1; [L26] float var_1_7 = 127.25; [L27] float var_1_8 = 128.5; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 0; [L30] signed long int var_1_13 = -10; [L31] unsigned char var_1_14 = 1; [L32] signed char var_1_16 = -1; [L33] signed char var_1_17 = -5; [L34] signed char var_1_18 = 2; [L35] double var_1_19 = 256.7; [L36] double var_1_20 = 256.5; [L37] double var_1_21 = 5.058; [L38] double var_1_22 = 2.4; [L39] double var_1_23 = 5.875; [L40] signed long int var_1_24 = -128; [L41] unsigned long int var_1_25 = 128; [L42] unsigned char var_1_26 = 128; [L43] unsigned long int var_1_27 = 4189380979; [L44] unsigned char var_1_28 = 0; [L45] unsigned char var_1_29 = 0; [L46] unsigned long int var_1_30 = 2; [L47] unsigned long int var_1_31 = 1701266831; [L48] unsigned long int var_1_32 = 1169870883; [L49] double var_1_33 = 4.3; [L50] double var_1_34 = 7.25; [L51] unsigned short int var_1_35 = 32; [L52] unsigned char last_1_var_1_1 = 1; [L53] unsigned char last_1_var_1_6 = 1; [L54] signed char last_1_var_1_16 = -1; [L55] double last_1_var_1_19 = 256.7; [L56] signed long int last_1_var_1_24 = -128; [L57] unsigned long int last_1_var_1_25 = 128; [L58] unsigned long int last_1_var_1_30 = 2; [L59] double last_1_var_1_33 = 4.3; [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L190] last_1_var_1_1 = var_1_1 [L191] last_1_var_1_6 = var_1_6 [L192] last_1_var_1_16 = var_1_16 [L193] last_1_var_1_19 = var_1_19 [L194] last_1_var_1_24 = var_1_24 [L195] last_1_var_1_25 = var_1_25 [L196] last_1_var_1_30 = var_1_30 [L197] last_1_var_1_33 = var_1_33 [L207] RET updateLastVariables() [L208] CALL updateVariables() [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L149] var_1_5 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L151] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L151] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L152] var_1_7 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427387900e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1, var_1_8=257/2] [L153] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427387900e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1, var_1_8=257/2] [L154] var_1_8 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L155] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L157] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L158] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L158] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L159] var_1_12 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L161] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L161] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L162] var_1_17 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L163] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L164] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L164] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L165] var_1_18 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L166] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L167] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L167] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L168] var_1_20 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L169] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L170] var_1_21 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L171] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L172] var_1_22 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L173] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L174] var_1_23 = __VERIFIER_nondet_double() [L175] CALL assume_abort_if_not((var_1_23 >= -230584.3009213691390e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 2305843.009213691390e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L175] RET assume_abort_if_not((var_1_23 >= -230584.3009213691390e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 2305843.009213691390e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L176] var_1_27 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_27 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L177] RET assume_abort_if_not(var_1_27 >= 3221225471) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L178] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L178] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L179] var_1_29 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L180] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L181] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L181] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L182] var_1_31 = __VERIFIER_nondet_ulong() [L183] CALL assume_abort_if_not(var_1_31 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L183] RET assume_abort_if_not(var_1_31 >= 1073741823) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L184] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L184] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L185] var_1_32 = __VERIFIER_nondet_ulong() [L186] CALL assume_abort_if_not(var_1_32 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L186] RET assume_abort_if_not(var_1_32 >= 1073741824) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L187] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L187] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L208] RET updateVariables() [L209] CALL step() [L63] COND TRUE last_1_var_1_6 || last_1_var_1_6 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L64] EXPR last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L64] COND FALSE !((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) [L68] unsigned long int stepLocal_6 = (var_1_27 - last_1_var_1_1) - var_1_4; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_6=-1073741830, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L69] EXPR last_1_var_1_30 & last_1_var_1_25 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_6=-1073741830, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L69] COND TRUE stepLocal_6 > (last_1_var_1_30 & last_1_var_1_25) [L70] var_1_26 = (var_1_4 + 4) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L74] COND TRUE last_1_var_1_33 > last_1_var_1_33 [L75] var_1_28 = (! ((var_1_4 != last_1_var_1_24) || var_1_29)) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L77] var_1_30 = ((((((var_1_31 + var_1_32)) < ((3305479224u - var_1_5))) ? ((var_1_31 + var_1_32)) : ((3305479224u - var_1_5)))) - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) [L78] var_1_33 = var_1_20 [L79] var_1_34 = var_1_22 [L80] var_1_35 = var_1_30 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=1] [L81] COND FALSE !(((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) [L88] var_1_6 = 0 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L90] unsigned char stepLocal_2 = var_1_14; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_2=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L91] COND FALSE !(stepLocal_2 && var_1_6) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L94] COND FALSE !(\read(var_1_28)) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L98] COND FALSE !(var_1_18 <= (~ var_1_4)) [L105] var_1_24 = var_1_18 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L107] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_0=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L108] COND FALSE !(var_1_28 && stepLocal_0) [L111] var_1_1 = ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L113] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=4, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L114] COND FALSE !(var_1_7 > var_1_33) [L121] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L123] signed char stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=4, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L124] COND FALSE !((var_1_16 ^ 1) >= stepLocal_3) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L133] signed long int stepLocal_5 = var_1_13; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=4, stepLocal_5=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L134] EXPR var_1_24 | var_1_35 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=4, stepLocal_5=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L134] signed long int stepLocal_4 = var_1_24 | var_1_35; [L135] COND TRUE (10000 / 64) >= stepLocal_4 [L136] var_1_25 = ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=4, stepLocal_5=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L209] RET step() [L210] CALL, EXPR property() [L200] EXPR ((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L200] EXPR ((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26)))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L200] EXPR (((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26))))) && ((((var_1_27 - last_1_var_1_1) - var_1_4) > (last_1_var_1_30 & last_1_var_1_25)) ? (var_1_26 == ((unsigned char) (var_1_4 + 4))) : (var_1_26 == ((unsigned char) (4 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L200-L201] return ((((((((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26))))) && ((((var_1_27 - last_1_var_1_1) - var_1_4) > (last_1_var_1_30 & last_1_var_1_25)) ? (var_1_26 == ((unsigned char) (var_1_4 + 4))) : (var_1_26 == ((unsigned char) (4 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) && ((last_1_var_1_33 > last_1_var_1_33) ? (var_1_28 == ((unsigned char) (! ((var_1_4 != last_1_var_1_24) || var_1_29)))) : 1)) && (var_1_30 == ((unsigned long int) ((((((var_1_31 + var_1_32)) < ((3305479224u - var_1_5))) ? ((var_1_31 + var_1_32)) : ((3305479224u - var_1_5)))) - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (var_1_33 == ((double) var_1_20))) && (var_1_34 == ((double) var_1_22))) && (var_1_35 == ((unsigned short int) var_1_30)) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1350 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1350 mSDsluCounter, 4646 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2956 mSDsCounter, 642 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 642 mSolverCounterUnsat, 1690 mSDtfsCounter, 383 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 544 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 300 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 5086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 11700/11700 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:16:47,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82b18cd242e9ca49d0125d9760f9ce4d46eda4589890d58c3d3555645b3c016 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:16:49,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:16:49,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:16:49,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:16:49,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:16:49,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:16:49,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:16:49,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:16:49,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:16:49,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:16:49,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:16:49,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:16:49,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:16:49,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:16:49,598 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:16:49,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:16:49,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:16:49,599 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:16:49,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:16:49,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:16:49,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:16:49,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:16:49,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:16:49,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:16:49,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:16:49,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:16:49,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:16:49,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:16:49,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:16:49,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:16:49,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:16:49,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:16:49,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:16:49,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:16:49,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:16:49,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:16:49,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:16:49,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:16:49,623 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:16:49,623 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:16:49,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:16:49,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:16:49,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:16:49,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:16:49,625 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:16:49,625 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82b18cd242e9ca49d0125d9760f9ce4d46eda4589890d58c3d3555645b3c016 [2024-10-24 09:16:49,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:16:49,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:16:49,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:16:49,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:16:49,999 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:16:50,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-24 09:16:51,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:16:51,915 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:16:51,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-24 09:16:51,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b37e6c7/3d762026a085435ba19ac8a775f4e549/FLAG63e05c345 [2024-10-24 09:16:52,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b37e6c7/3d762026a085435ba19ac8a775f4e549 [2024-10-24 09:16:52,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:16:52,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:16:52,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:16:52,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:16:52,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:16:52,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27519c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52, skipping insertion in model container [2024-10-24 09:16:52,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:16:52,463 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_loopvsstraightlinecode_100-while_file-43.i[916,929] [2024-10-24 09:16:52,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:16:52,611 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:16:52,627 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_loopvsstraightlinecode_100-while_file-43.i[916,929] [2024-10-24 09:16:52,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:16:52,711 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:16:52,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52 WrapperNode [2024-10-24 09:16:52,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:16:52,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:16:52,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:16:52,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:16:52,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,784 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-10-24 09:16:52,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:16:52,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:16:52,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:16:52,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:16:52,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,822 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:16:52,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:16:52,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:16:52,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:16:52,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:16:52,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (1/1) ... [2024-10-24 09:16:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:16:52,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:16:52,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:16:52,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:16:52,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:16:52,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:16:52,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:16:52,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:16:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:16:52,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:16:53,096 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:16:53,099 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:17:03,253 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-24 09:17:03,253 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:17:03,309 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:17:03,309 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:17:03,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:17:03 BoogieIcfgContainer [2024-10-24 09:17:03,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:17:03,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:17:03,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:17:03,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:17:03,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:16:52" (1/3) ... [2024-10-24 09:17:03,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b03e425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:17:03, skipping insertion in model container [2024-10-24 09:17:03,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:16:52" (2/3) ... [2024-10-24 09:17:03,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b03e425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:17:03, skipping insertion in model container [2024-10-24 09:17:03,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:17:03" (3/3) ... [2024-10-24 09:17:03,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-24 09:17:03,337 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:17:03,337 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:17:03,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:17:03,449 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;@302644f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:17:03,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:17:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 09:17:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 09:17:03,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:17:03,475 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:17:03,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:17:03,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:17:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1210957691, now seen corresponding path program 1 times [2024-10-24 09:17:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:17:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637535487] [2024-10-24 09:17:03,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:17:03,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:17:03,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:17:03,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:17:03,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:17:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:17:04,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:17:04,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:17:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-24 09:17:04,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:17:04,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:17:04,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637535487] [2024-10-24 09:17:04,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637535487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:17:04,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:17:04,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:17:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097483941] [2024-10-24 09:17:04,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:17:04,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:17:04,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:17:04,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:17:04,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:17:04,113 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 09:17:08,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:17:08,315 INFO L93 Difference]: Finished difference Result 157 states and 276 transitions. [2024-10-24 09:17:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:17:08,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-10-24 09:17:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:17:08,379 INFO L225 Difference]: With dead ends: 157 [2024-10-24 09:17:08,380 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 09:17:08,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:17:08,387 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:17:08,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 09:17:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 09:17:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 09:17:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 09:17:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-24 09:17:08,445 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 168 [2024-10-24 09:17:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:17:08,446 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-24 09:17:08,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-24 09:17:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-24 09:17:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 09:17:08,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:17:08,451 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:17:08,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:17:08,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:17:08,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:17:08,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:17:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1061401487, now seen corresponding path program 1 times [2024-10-24 09:17:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:17:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378427703] [2024-10-24 09:17:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:17:08,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:17:08,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:17:08,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:17:08,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:17:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:17:09,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 09:17:09,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:17:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:17:11,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:17:11,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:17:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378427703] [2024-10-24 09:17:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378427703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:17:11,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:17:11,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:17:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46235272] [2024-10-24 09:17:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:17:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:17:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:17:11,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:17:11,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:17:11,391 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:17:13,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:17,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:21,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:25,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:29,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:33,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:17:33,765 INFO L93 Difference]: Finished difference Result 233 states and 359 transitions. [2024-10-24 09:17:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:17:33,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-10-24 09:17:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:17:33,817 INFO L225 Difference]: With dead ends: 233 [2024-10-24 09:17:33,817 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 09:17:33,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:17:33,819 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 75 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:17:33,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 343 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 22.3s Time] [2024-10-24 09:17:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 09:17:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-10-24 09:17:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 09:17:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 193 transitions. [2024-10-24 09:17:33,848 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 193 transitions. Word has length 168 [2024-10-24 09:17:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:17:33,849 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 193 transitions. [2024-10-24 09:17:33,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:17:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 193 transitions. [2024-10-24 09:17:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 09:17:33,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:17:33,853 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:17:33,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 09:17:34,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:17:34,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:17:34,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:17:34,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1517708599, now seen corresponding path program 1 times [2024-10-24 09:17:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:17:34,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698419549] [2024-10-24 09:17:34,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:17:34,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:17:34,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:17:34,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:17:34,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:17:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:17:34,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 09:17:34,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:17:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:17:38,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:17:38,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:17:38,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698419549] [2024-10-24 09:17:38,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698419549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:17:38,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:17:38,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:17:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469555988] [2024-10-24 09:17:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:17:38,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:17:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:17:38,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:17:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:17:38,988 INFO L87 Difference]: Start difference. First operand 126 states and 193 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:17:43,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:47,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:51,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:55,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:59,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:17:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:17:59,789 INFO L93 Difference]: Finished difference Result 247 states and 382 transitions. [2024-10-24 09:17:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:17:59,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-24 09:17:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:17:59,843 INFO L225 Difference]: With dead ends: 247 [2024-10-24 09:17:59,844 INFO L226 Difference]: Without dead ends: 170 [2024-10-24 09:17:59,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:17:59,846 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 99 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-10-24 09:17:59,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 359 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 20.7s Time] [2024-10-24 09:17:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-24 09:17:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2024-10-24 09:17:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 09:17:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2024-10-24 09:17:59,878 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 169 [2024-10-24 09:17:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:17:59,879 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2024-10-24 09:17:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:17:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2024-10-24 09:17:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 09:17:59,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:17:59,882 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:17:59,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 09:18:00,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:18:00,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:18:00,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:18:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 700060149, now seen corresponding path program 1 times [2024-10-24 09:18:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:18:00,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086619901] [2024-10-24 09:18:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:18:00,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:18:00,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:18:00,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:18:00,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 09:18:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:18:00,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 09:18:00,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:18:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-24 09:18:00,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:18:00,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:18:00,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086619901] [2024-10-24 09:18:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086619901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:18:00,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:18:00,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:18:00,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460238951] [2024-10-24 09:18:00,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:18:00,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:18:00,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:18:00,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:18:00,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:18:00,646 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-24 09:18:05,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []