./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.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 d886209e0041166e609cb28184ac0f6dd830b411c825b91b025d8d04f07d18e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:00:46,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:00:46,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:00:46,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:00:46,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:00:46,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:00:46,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:00:46,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:00:46,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:00:46,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:00:46,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:00:46,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:00:46,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:00:46,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:00:46,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:00:46,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:00:46,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:00:46,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:00:46,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:00:46,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:00:46,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:00:46,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:00:46,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:00:46,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:00:46,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:00:46,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:00:46,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:00:46,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:00:46,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:00:46,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:00:46,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:00:46,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:00:46,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:00:46,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:00:46,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:00:46,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:00:46,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:00:46,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:00:46,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:00:46,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:00:46,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:00:46,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:00:46,177 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 -> d886209e0041166e609cb28184ac0f6dd830b411c825b91b025d8d04f07d18e8 [2024-11-10 04:00:46,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:00:46,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:00:46,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:00:46,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:00:46,410 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:00:46,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.i [2024-11-10 04:00:47,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:00:48,084 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:00:48,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.i [2024-11-10 04:00:48,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3550c7d7c/a1f61e7c7a3e47429890dbbb06ce5386/FLAG521921f22 [2024-11-10 04:00:48,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3550c7d7c/a1f61e7c7a3e47429890dbbb06ce5386 [2024-11-10 04:00:48,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:00:48,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:00:48,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:00:48,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:00:48,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:00:48,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a78a60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48, skipping insertion in model container [2024-11-10 04:00:48,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:00:48,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.i[914,927] [2024-11-10 04:00:48,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:00:48,354 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:00:48,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.i[914,927] [2024-11-10 04:00:48,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:00:48,470 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:00:48,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48 WrapperNode [2024-11-10 04:00:48,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:00:48,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:00:48,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:00:48,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:00:48,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,529 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-10 04:00:48,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:00:48,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:00:48,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:00:48,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:00:48,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,556 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-11-10 04:00:48,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:00:48,576 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:00:48,576 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:00:48,576 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:00:48,577 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (1/1) ... [2024-11-10 04:00:48,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:00:48,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:00:48,611 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-11-10 04:00:48,614 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-11-10 04:00:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:00:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:00:48,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:00:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:00:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:00:48,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:00:48,739 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:00:48,745 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:00:49,082 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 04:00:49,082 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:00:49,111 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:00:49,112 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:00:49,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:00:49 BoogieIcfgContainer [2024-11-10 04:00:49,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:00:49,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:00:49,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:00:49,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:00:49,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:00:48" (1/3) ... [2024-11-10 04:00:49,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d31f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:00:49, skipping insertion in model container [2024-11-10 04:00:49,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:48" (2/3) ... [2024-11-10 04:00:49,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d31f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:00:49, skipping insertion in model container [2024-11-10 04:00:49,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:00:49" (3/3) ... [2024-11-10 04:00:49,119 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-1.i [2024-11-10 04:00:49,131 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:00:49,132 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:00:49,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:00:49,199 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;@155883f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:00:49,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:00:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 04:00:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 04:00:49,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:49,222 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:49,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:49,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -18317958, now seen corresponding path program 1 times [2024-11-10 04:00:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:49,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561888514] [2024-11-10 04:00:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:00:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:00:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:00:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:00:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:00:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:00:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:00:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:00:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:00:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:00:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:00:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:00:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:00:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:00:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:00:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:00:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:00:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:00:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:00:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:00:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:00:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:00:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:00:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:00:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:00:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:00:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:00:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:00:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:00:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:00:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:00:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 04:00:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:00:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 04:00:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:00:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 04:00:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:00:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561888514] [2024-11-10 04:00:50,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561888514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:00:50,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:00:50,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:00:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919935696] [2024-11-10 04:00:50,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:00:50,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:00:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:00:50,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:00:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:00:50,414 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 57 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:00:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:00:50,497 INFO L93 Difference]: Finished difference Result 266 states and 488 transitions. [2024-11-10 04:00:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:00:50,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 217 [2024-11-10 04:00:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:00:50,514 INFO L225 Difference]: With dead ends: 266 [2024-11-10 04:00:50,514 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 04:00:50,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:00:50,523 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 61 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:00:50,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 265 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:00:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 04:00:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2024-11-10 04:00:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 99 states have internal predecessors, (124), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 04:00:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2024-11-10 04:00:50,592 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 217 [2024-11-10 04:00:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:00:50,593 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2024-11-10 04:00:50,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:00:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2024-11-10 04:00:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-10 04:00:50,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:50,600 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:50,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:00:50,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:50,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2026974994, now seen corresponding path program 1 times [2024-11-10 04:00:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:50,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001743923] [2024-11-10 04:00:50,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:00:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:00:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:00:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:00:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:00:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:00:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:00:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:00:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:00:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:00:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:00:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:00:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:00:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:00:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:00:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:00:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:00:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:00:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:00:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:00:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:00:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:00:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:00:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:00:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:00:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:00:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:00:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:00:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:00:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:00:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:00:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 04:00:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:00:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 04:00:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:00:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 04:00:51,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:00:51,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001743923] [2024-11-10 04:00:51,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001743923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:00:51,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:00:51,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 04:00:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179911695] [2024-11-10 04:00:51,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:00:51,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:00:51,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:00:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:00:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:00:51,196 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 04:00:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:00:51,923 INFO L93 Difference]: Finished difference Result 480 states and 707 transitions. [2024-11-10 04:00:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:00:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-11-10 04:00:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:00:51,928 INFO L225 Difference]: With dead ends: 480 [2024-11-10 04:00:51,928 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 04:00:51,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-10 04:00:51,930 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 357 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:00:51,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 405 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 04:00:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 04:00:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 202. [2024-11-10 04:00:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 127 states have (on average 1.2755905511811023) internal successors, (162), 127 states have internal predecessors, (162), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 04:00:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2024-11-10 04:00:51,977 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 218 [2024-11-10 04:00:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:00:51,979 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2024-11-10 04:00:51,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 04:00:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2024-11-10 04:00:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-10 04:00:51,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:51,985 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:51,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:00:51,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:51,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:51,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2112517875, now seen corresponding path program 1 times [2024-11-10 04:00:51,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:51,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097415963] [2024-11-10 04:00:51,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:51,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:00:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:00:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:00:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:00:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:00:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:00:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:00:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:00:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:00:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:00:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:00:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:00:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:00:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:00:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:00:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:00:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:00:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:00:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:00:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:00:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:00:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:00:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:00:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:00:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:00:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:00:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:00:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:00:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:00:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:00:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:00:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 04:00:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:00:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 04:00:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:00:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 04:00:52,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:00:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097415963] [2024-11-10 04:00:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097415963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:00:52,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:00:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 04:00:52,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383244512] [2024-11-10 04:00:52,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:00:52,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:00:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:00:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:00:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:00:52,524 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 04:00:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:00:53,007 INFO L93 Difference]: Finished difference Result 575 states and 861 transitions. [2024-11-10 04:00:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 04:00:53,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-11-10 04:00:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:00:53,012 INFO L225 Difference]: With dead ends: 575 [2024-11-10 04:00:53,014 INFO L226 Difference]: Without dead ends: 376 [2024-11-10 04:00:53,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:00:53,019 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 171 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:00:53,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 661 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:00:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-10 04:00:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 224. [2024-11-10 04:00:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 149 states have internal predecessors, (191), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 04:00:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 331 transitions. [2024-11-10 04:00:53,095 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 331 transitions. Word has length 218 [2024-11-10 04:00:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:00:53,098 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 331 transitions. [2024-11-10 04:00:53,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 04:00:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 331 transitions. [2024-11-10 04:00:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-10 04:00:53,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:53,101 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:53,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:00:53,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2141147026, now seen corresponding path program 1 times [2024-11-10 04:00:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:53,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792744015] [2024-11-10 04:00:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:00:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:00:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:00:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:00:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:00:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:00:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:00:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:00:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:00:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:00:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:00:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:00:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:00:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:00:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:00:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:00:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:00:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:00:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:00:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:00:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:00:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:00:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:00:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:00:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:00:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:00:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:00:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:00:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:00:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:00:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:00:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 04:00:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:00:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 04:00:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:00:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 04:00:53,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:00:53,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792744015] [2024-11-10 04:00:53,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792744015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:00:53,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:00:53,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:00:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68538946] [2024-11-10 04:00:53,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:00:53,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:00:53,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:00:53,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:00:53,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:00:53,509 INFO L87 Difference]: Start difference. First operand 224 states and 331 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:00:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:00:53,770 INFO L93 Difference]: Finished difference Result 588 states and 873 transitions. [2024-11-10 04:00:53,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:00:53,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-11-10 04:00:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:00:53,777 INFO L225 Difference]: With dead ends: 588 [2024-11-10 04:00:53,777 INFO L226 Difference]: Without dead ends: 367 [2024-11-10 04:00:53,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:00:53,779 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 122 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:00:53,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 494 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:00:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-10 04:00:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 216. [2024-11-10 04:00:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 141 states have internal predecessors, (179), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 04:00:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 319 transitions. [2024-11-10 04:00:53,870 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 319 transitions. Word has length 218 [2024-11-10 04:00:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:00:53,870 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 319 transitions. [2024-11-10 04:00:53,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:00:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 319 transitions. [2024-11-10 04:00:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-10 04:00:53,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:53,872 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:53,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:00:53,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:53,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1897892275, now seen corresponding path program 1 times [2024-11-10 04:00:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191864705] [2024-11-10 04:00:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:00:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 04:00:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 04:00:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:00:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:00:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 04:00:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:00:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:00:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:00:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:00:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:00:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:00:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:00:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:00:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:00:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:00:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:00:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:00:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:00:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:00:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:00:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:00:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:00:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:00:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:00:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:00:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:00:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:00:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:00:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:00:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:00:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 04:00:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 04:00:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 04:00:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 04:00:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 04:00:54,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:00:54,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191864705] [2024-11-10 04:00:54,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191864705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:00:54,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:00:54,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 04:00:54,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576742194] [2024-11-10 04:00:54,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:00:54,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:00:54,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:00:54,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:00:54,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:00:54,191 INFO L87 Difference]: Start difference. First operand 216 states and 319 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 04:00:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:00:54,519 INFO L93 Difference]: Finished difference Result 413 states and 602 transitions. [2024-11-10 04:00:54,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:00:54,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-11-10 04:00:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:00:54,522 INFO L225 Difference]: With dead ends: 413 [2024-11-10 04:00:54,522 INFO L226 Difference]: Without dead ends: 305 [2024-11-10 04:00:54,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:00:54,524 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 231 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:00:54,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 287 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:00:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-10 04:00:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 216. [2024-11-10 04:00:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 141 states have internal predecessors, (177), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 04:00:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 317 transitions. [2024-11-10 04:00:54,562 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 317 transitions. Word has length 218 [2024-11-10 04:00:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:00:54,562 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 317 transitions. [2024-11-10 04:00:54,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 04:00:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 317 transitions. [2024-11-10 04:00:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-10 04:00:54,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:54,585 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:54,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:00:54,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:54,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2012064307, now seen corresponding path program 1 times [2024-11-10 04:00:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:54,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407230654] [2024-11-10 04:00:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:00:54,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156357733] [2024-11-10 04:00:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:54,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:00:54,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:00:54,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:00:54,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:00:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:00:54,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:00:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:00:55,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:00:55,023 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:00:55,023 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:00:55,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:00:55,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 04:00:55,229 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 04:00:55,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:00:55,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:00:55 BoogieIcfgContainer [2024-11-10 04:00:55,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:00:55,340 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:00:55,340 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:00:55,340 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:00:55,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:00:49" (3/4) ... [2024-11-10 04:00:55,343 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:00:55,344 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:00:55,344 INFO L158 Benchmark]: Toolchain (without parser) took 7231.08ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 94.8MB in the beginning and 209.1MB in the end (delta: -114.3MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-11-10 04:00:55,344 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:00:55,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.86ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 137.0MB in the end (delta: -42.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-10 04:00:55,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.52ms. Allocated memory is still 167.8MB. Free memory was 137.0MB in the beginning and 132.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:00:55,345 INFO L158 Benchmark]: Boogie Preprocessor took 45.54ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 129.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:00:55,345 INFO L158 Benchmark]: IcfgBuilder took 536.51ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 104.3MB in the end (delta: 24.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 04:00:55,345 INFO L158 Benchmark]: TraceAbstraction took 6225.87ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 103.4MB in the beginning and 209.1MB in the end (delta: -105.7MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-10 04:00:55,346 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 327.2MB. Free memory is still 209.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:00:55,347 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.86ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 137.0MB in the end (delta: -42.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.52ms. Allocated memory is still 167.8MB. Free memory was 137.0MB in the beginning and 132.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.54ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 129.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 536.51ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 104.3MB in the end (delta: 24.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6225.87ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 103.4MB in the beginning and 209.1MB in the end (delta: -105.7MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 327.2MB. Free memory is still 209.1MB. 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 someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryFLOATComparisonOperation at line 172. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_29 = 50; [L45] unsigned long int var_1_30 = 1000000000; [L46] unsigned long int var_1_31 = 4; [L47] unsigned long int var_1_32 = 100000; [L48] unsigned long int var_1_33 = 10; [L49] unsigned char var_1_34 = 0; [L50] unsigned char var_1_35 = 0; [L51] unsigned short int var_1_36 = 128; [L52] signed char var_1_37 = 8; [L53] signed char var_1_38 = -5; [L54] unsigned long int var_1_39 = 128; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2, var_1_9=4000000001/4] [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] FCALL updateLastVariables() [L180] CALL updateVariables() [L114] var_1_9 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L115] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L116] var_1_11 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L117] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L118] var_1_13 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L119] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L120] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L120] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L121] var_1_14 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L122] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L123] var_1_16 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L124] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L125] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L125] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L126] var_1_17 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L127] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L128] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L128] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L129] var_1_19 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L130] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L131] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L131] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L132] var_1_20 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L133] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L134] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L134] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L135] var_1_21 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L136] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L137] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L137] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L138] var_1_22 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L139] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L140] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L140] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L141] var_1_24 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L142] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L143] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L143] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L144] var_1_25 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L145] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L146] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L147] var_1_26 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L148] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L149] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L149] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_29=50, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L150] var_1_29 = __VERIFIER_nondet_ulong() [L151] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L151] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L152] CALL assume_abort_if_not(var_1_29 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L152] RET assume_abort_if_not(var_1_29 <= 4294967295) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_30=1000000000, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L153] var_1_30 = __VERIFIER_nondet_ulong() [L154] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L154] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L155] CALL assume_abort_if_not(var_1_30 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L155] RET assume_abort_if_not(var_1_30 <= 4294967295) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_31=4, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L156] var_1_31 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L158] CALL assume_abort_if_not(var_1_31 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L158] RET assume_abort_if_not(var_1_31 <= 4294967295) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_32=100000, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L159] var_1_32 = __VERIFIER_nondet_ulong() [L160] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L160] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L161] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L161] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L162] var_1_35 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L163] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L164] CALL assume_abort_if_not(var_1_35 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L164] RET assume_abort_if_not(var_1_35 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-5, var_1_39=128, var_1_6=63/2] [L165] var_1_38 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_38 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-127, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-127, var_1_39=128, var_1_6=63/2] [L166] RET assume_abort_if_not(var_1_38 >= -127) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-127, var_1_39=128, var_1_6=63/2] [L167] CALL assume_abort_if_not(var_1_38 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-127, var_1_39=128, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-127, var_1_39=128, var_1_6=63/2] [L167] RET assume_abort_if_not(var_1_38 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-127, var_1_39=128, var_1_6=63/2] [L180] RET updateVariables() [L181] CALL step() [L58] EXPR var_1_30 | (var_1_31 + var_1_32) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-127, var_1_39=128, var_1_6=63/2] [L58] COND TRUE var_1_29 < (var_1_30 | (var_1_31 + var_1_32)) [L59] var_1_28 = 200 VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=10, var_1_34=0, var_1_35=0, var_1_36=128, var_1_37=8, var_1_38=-127, var_1_39=128, var_1_6=63/2] [L61] var_1_33 = var_1_28 [L62] var_1_34 = var_1_35 [L63] var_1_36 = var_1_28 [L64] var_1_37 = var_1_38 [L65] var_1_39 = var_1_36 [L66] var_1_15 = (var_1_16 - var_1_17) [L67] var_1_27 = var_1_21 [L68] unsigned char stepLocal_1 = var_1_27; [L69] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L70] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L71] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L79] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L82] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L83] COND FALSE !(var_1_27 > stepLocal_2) [L86] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L88] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L89] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L91] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L92] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L101] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L102] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L103] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L106] COND TRUE 1 >= stepLocal_3 [L107] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=200, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=200, var_1_34=0, var_1_35=0, var_1_36=200, var_1_37=-127, var_1_38=-127, var_1_39=200, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 942 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 942 mSDsluCounter, 2112 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1250 mSDsCounter, 448 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 983 IncrementalHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 448 mSolverCounterUnsat, 862 mSDtfsCounter, 983 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=3, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 587 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1525 NumberOfCodeBlocks, 1525 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1084 ConstructedInterpolants, 0 QuantifiedInterpolants, 2604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 11900/11900 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-11-10 04:00:55,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.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 d886209e0041166e609cb28184ac0f6dd830b411c825b91b025d8d04f07d18e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:00:57,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:00:57,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:00:57,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:00:57,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:00:57,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:00:57,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:00:57,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:00:57,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:00:57,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:00:57,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:00:57,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:00:57,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:00:57,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:00:57,631 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:00:57,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:00:57,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:00:57,632 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:00:57,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:00:57,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:00:57,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:00:57,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:00:57,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:00:57,636 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:00:57,637 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:00:57,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:00:57,637 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:00:57,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:00:57,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:00:57,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:00:57,638 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:00:57,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:00:57,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:00:57,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:00:57,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:00:57,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:00:57,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:00:57,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:00:57,641 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:00:57,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:00:57,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:00:57,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:00:57,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:00:57,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:00:57,642 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d886209e0041166e609cb28184ac0f6dd830b411c825b91b025d8d04f07d18e8 [2024-11-10 04:00:57,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:00:57,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:00:57,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:00:57,961 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:00:57,961 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:00:57,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.i [2024-11-10 04:00:59,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:00:59,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:00:59,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.i [2024-11-10 04:00:59,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dd977f2/d309115eac8c49b2baf5b1cc15d99a8c/FLAG474c3950d [2024-11-10 04:00:59,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dd977f2/d309115eac8c49b2baf5b1cc15d99a8c [2024-11-10 04:00:59,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:00:59,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:00:59,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:00:59,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:00:59,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:00:59,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:00:59" (1/1) ... [2024-11-10 04:00:59,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544d4595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:59, skipping insertion in model container [2024-11-10 04:00:59,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:00:59" (1/1) ... [2024-11-10 04:01:00,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:01:00,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.i[914,927] [2024-11-10 04:01:00,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:01:00,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:01:00,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-1.i[914,927] [2024-11-10 04:01:00,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:01:00,317 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:01:00,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00 WrapperNode [2024-11-10 04:01:00,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:01:00,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:01:00,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:01:00,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:01:00,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,386 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-10 04:01:00,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:01:00,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:01:00,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:01:00,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:01:00,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,431 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-11-10 04:01:00,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:01:00,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:01:00,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:01:00,459 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:01:00,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (1/1) ... [2024-11-10 04:01:00,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:01:00,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:01:00,487 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-11-10 04:01:00,490 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-11-10 04:01:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:01:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:01:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:01:00,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:01:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:01:00,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:01:00,621 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:01:00,624 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:01:01,056 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 04:01:01,057 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:01:01,090 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:01:01,091 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:01:01,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:01:01 BoogieIcfgContainer [2024-11-10 04:01:01,091 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:01:01,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:01:01,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:01:01,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:01:01,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:00:59" (1/3) ... [2024-11-10 04:01:01,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3439a991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:01:01, skipping insertion in model container [2024-11-10 04:01:01,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:00" (2/3) ... [2024-11-10 04:01:01,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3439a991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:01:01, skipping insertion in model container [2024-11-10 04:01:01,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:01:01" (3/3) ... [2024-11-10 04:01:01,119 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-1.i [2024-11-10 04:01:01,157 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:01:01,157 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:01:01,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:01:01,284 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;@647703cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:01:01,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:01:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 54 states have internal predecessors, (69), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 04:01:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-10 04:01:01,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:01,327 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:01,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:01,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:01,345 INFO L85 PathProgramCache]: Analyzing trace with hash -217813519, now seen corresponding path program 1 times [2024-11-10 04:01:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:01,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9632770] [2024-11-10 04:01:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:01,374 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-11-10 04:01:01,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:01,380 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-11-10 04:01:01,381 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-11-10 04:01:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:01,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:01:01,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:01:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1080 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:01:01,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:01:01,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:01:01,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9632770] [2024-11-10 04:01:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9632770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:01:01,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:01:01,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409152606] [2024-11-10 04:01:01,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:01,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:01:01,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:01:01,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:01:01,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:01:01,776 INFO L87 Difference]: Start difference. First operand has 91 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 54 states have internal predecessors, (69), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 04:01:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:01,804 INFO L93 Difference]: Finished difference Result 174 states and 306 transitions. [2024-11-10 04:01:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:01:01,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 216 [2024-11-10 04:01:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:01,813 INFO L225 Difference]: With dead ends: 174 [2024-11-10 04:01:01,813 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 04:01:01,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 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-11-10 04:01:01,823 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:01,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:01:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 04:01:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 04:01:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 04:01:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2024-11-10 04:01:01,885 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 216 [2024-11-10 04:01:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:01,885 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2024-11-10 04:01:01,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 04:01:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2024-11-10 04:01:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-10 04:01:01,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:01,890 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:01,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 04:01:02,091 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-11-10 04:01:02,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:02,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1806044656, now seen corresponding path program 1 times [2024-11-10 04:01:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357650590] [2024-11-10 04:01:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:02,094 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-11-10 04:01:02,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:02,098 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-11-10 04:01:02,113 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-11-10 04:01:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:02,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:01:02,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:01:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1175 proven. 120 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2024-11-10 04:01:02,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:01:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 04:01:03,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:01:03,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357650590] [2024-11-10 04:01:03,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357650590] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 04:01:03,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:01:03,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-11-10 04:01:03,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236165228] [2024-11-10 04:01:03,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:03,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:01:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:01:03,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:01:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:01:03,251 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:01:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:03,358 INFO L93 Difference]: Finished difference Result 169 states and 257 transitions. [2024-11-10 04:01:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:01:03,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 216 [2024-11-10 04:01:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:03,363 INFO L225 Difference]: With dead ends: 169 [2024-11-10 04:01:03,367 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 04:01:03,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:01:03,369 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:03,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:01:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 04:01:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 04:01:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 04:01:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions. [2024-11-10 04:01:03,391 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 129 transitions. Word has length 216 [2024-11-10 04:01:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:03,393 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 129 transitions. [2024-11-10 04:01:03,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:01:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 129 transitions. [2024-11-10 04:01:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-10 04:01:03,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:03,400 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:03,411 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-11-10 04:01:03,601 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-11-10 04:01:03,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:03,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash 9093297, now seen corresponding path program 1 times [2024-11-10 04:01:03,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:03,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031080685] [2024-11-10 04:01:03,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:03,606 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-11-10 04:01:03,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:03,607 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-11-10 04:01:03,609 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-11-10 04:01:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:03,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:01:03,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:01:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 04:01:04,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:01:04,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:01:04,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031080685] [2024-11-10 04:01:04,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031080685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:04,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:01:04,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:01:04,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218330584] [2024-11-10 04:01:04,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:04,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:01:04,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:01:04,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:01:04,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:01:04,269 INFO L87 Difference]: Start difference. First operand 86 states and 129 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:01:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:04,304 INFO L93 Difference]: Finished difference Result 252 states and 381 transitions. [2024-11-10 04:01:04,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:01:04,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 216 [2024-11-10 04:01:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:04,312 INFO L225 Difference]: With dead ends: 252 [2024-11-10 04:01:04,312 INFO L226 Difference]: Without dead ends: 169 [2024-11-10 04:01:04,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 214 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-11-10 04:01:04,314 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 18 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:04,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 255 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:01:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-10 04:01:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-10 04:01:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 93 states have internal predecessors, (112), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 04:01:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 252 transitions. [2024-11-10 04:01:04,339 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 252 transitions. Word has length 216 [2024-11-10 04:01:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:04,340 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 252 transitions. [2024-11-10 04:01:04,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:01:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 252 transitions. [2024-11-10 04:01:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 04:01:04,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:04,343 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:04,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 04:01:04,546 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-11-10 04:01:04,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:04,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1177226089, now seen corresponding path program 1 times [2024-11-10 04:01:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:04,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209966205] [2024-11-10 04:01:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:04,549 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-11-10 04:01:04,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:04,552 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-11-10 04:01:04,553 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-11-10 04:01:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:04,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 04:01:04,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:01:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1152 proven. 63 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2024-11-10 04:01:04,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:01:05,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:01:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209966205] [2024-11-10 04:01:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209966205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:01:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [49527898] [2024-11-10 04:01:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:05,006 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 04:01:05,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 04:01:05,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 04:01:05,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-10 04:01:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:05,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 04:01:05,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:01:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 04:01:05,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:01:05,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [49527898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:05,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:01:05,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-10 04:01:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269223164] [2024-11-10 04:01:05,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:05,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:01:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:01:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:01:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:01:05,630 INFO L87 Difference]: Start difference. First operand 166 states and 252 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:01:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:06,036 INFO L93 Difference]: Finished difference Result 378 states and 557 transitions. [2024-11-10 04:01:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:01:06,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 217 [2024-11-10 04:01:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:06,041 INFO L225 Difference]: With dead ends: 378 [2024-11-10 04:01:06,041 INFO L226 Difference]: Without dead ends: 295 [2024-11-10 04:01:06,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 04:01:06,045 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 133 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:06,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 504 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:01:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-10 04:01:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 211. [2024-11-10 04:01:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 124 states have internal predecessors, (146), 83 states have call successors, (83), 4 states have call predecessors, (83), 4 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-10 04:01:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 312 transitions. [2024-11-10 04:01:06,085 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 312 transitions. Word has length 217 [2024-11-10 04:01:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:06,086 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 312 transitions. [2024-11-10 04:01:06,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:01:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 312 transitions. [2024-11-10 04:01:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 04:01:06,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:06,088 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:06,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 04:01:06,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-10 04:01:06,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 04:01:06,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:06,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:06,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1262768970, now seen corresponding path program 1 times [2024-11-10 04:01:06,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:06,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134315031] [2024-11-10 04:01:06,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:06,494 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-11-10 04:01:06,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:06,499 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:01:06,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 04:01:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:06,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 04:01:06,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:01:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1175 proven. 120 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2024-11-10 04:01:07,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:01:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 04:01:07,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:01:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134315031] [2024-11-10 04:01:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134315031] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 04:01:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:01:07,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-10 04:01:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889035391] [2024-11-10 04:01:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:07,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 04:01:07,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:01:07,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 04:01:07,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:01:07,342 INFO L87 Difference]: Start difference. First operand 211 states and 312 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:01:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:07,677 INFO L93 Difference]: Finished difference Result 723 states and 1066 transitions. [2024-11-10 04:01:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 04:01:07,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 217 [2024-11-10 04:01:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:07,683 INFO L225 Difference]: With dead ends: 723 [2024-11-10 04:01:07,683 INFO L226 Difference]: Without dead ends: 538 [2024-11-10 04:01:07,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-10 04:01:07,685 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 247 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:07,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 694 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:01:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-10 04:01:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 308. [2024-11-10 04:01:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 183 states have (on average 1.185792349726776) internal successors, (217), 185 states have internal predecessors, (217), 118 states have call successors, (118), 6 states have call predecessors, (118), 6 states have return successors, (118), 116 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-10 04:01:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 453 transitions. [2024-11-10 04:01:07,768 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 453 transitions. Word has length 217 [2024-11-10 04:01:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:07,776 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 453 transitions. [2024-11-10 04:01:07,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 04:01:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 453 transitions. [2024-11-10 04:01:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 04:01:07,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:07,778 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:07,795 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 (7)] Forceful destruction successful, exit code 0 [2024-11-10 04:01:07,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-11-10 04:01:07,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:07,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1291398121, now seen corresponding path program 1 times [2024-11-10 04:01:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086115340] [2024-11-10 04:01:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:07,985 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-11-10 04:01:07,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:07,986 INFO L229 MonitoredProcess]: Starting monitored process 8 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-11-10 04:01:07,988 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 (8)] Waiting until timeout for monitored process [2024-11-10 04:01:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:08,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 04:01:08,166 INFO L278 TraceCheckSpWp]: Computing forward predicates...