./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.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 432664c2eda1030555a8d42748674a5f8f3357a27417c048e2327859bae46f10 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:20:16,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:20:16,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:20:16,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:20:16,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:20:16,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:20:16,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:20:16,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:20:16,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:20:16,353 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:20:16,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:20:16,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:20:16,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:20:16,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:20:16,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:20:16,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:20:16,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:20:16,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:20:16,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:20:16,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:20:16,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:20:16,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:20:16,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:20:16,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:20:16,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:20:16,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:20:16,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:20:16,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:20:16,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:20:16,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:20:16,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:20:16,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:20:16,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:20:16,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:20:16,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:20:16,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:20:16,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:20:16,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:20:16,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:20:16,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:20:16,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:20:16,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:20:16,363 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 -> 432664c2eda1030555a8d42748674a5f8f3357a27417c048e2327859bae46f10 [2024-11-20 06:20:16,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:20:16,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:20:16,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:20:16,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:20:16,616 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:20:16,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i [2024-11-20 06:20:18,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:20:18,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:20:18,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i [2024-11-20 06:20:18,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0539c65f3/912619a3a89b4841a1d1e78eb6c34b9a/FLAGf77cd5a03 [2024-11-20 06:20:18,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0539c65f3/912619a3a89b4841a1d1e78eb6c34b9a [2024-11-20 06:20:18,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:20:18,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:20:18,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:20:18,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:20:18,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:20:18,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:18,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5faa2235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18, skipping insertion in model container [2024-11-20 06:20:18,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:18,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:20:18,784 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_loopvsstraightlinecode_100-while_file-10.i[916,929] [2024-11-20 06:20:18,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:20:18,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:20:18,922 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_loopvsstraightlinecode_100-while_file-10.i[916,929] [2024-11-20 06:20:18,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:20:18,964 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:20:18,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18 WrapperNode [2024-11-20 06:20:18,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:20:18,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:20:18,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:20:18,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:20:18,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,085 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 291 [2024-11-20 06:20:19,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:20:19,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:20:19,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:20:19,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:20:19,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,141 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-20 06:20:19,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:20:19,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:20:19,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:20:19,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:20:19,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (1/1) ... [2024-11-20 06:20:19,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:20:19,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:19,223 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-20 06:20:19,226 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-20 06:20:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:20:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:20:19,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:20:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:20:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:20:19,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:20:19,340 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:20:19,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:20:19,830 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-20 06:20:19,830 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:20:19,849 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:20:19,849 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:20:19,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:20:19 BoogieIcfgContainer [2024-11-20 06:20:19,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:20:19,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:20:19,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:20:19,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:20:19,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:20:18" (1/3) ... [2024-11-20 06:20:19,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b21b5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:20:19, skipping insertion in model container [2024-11-20 06:20:19,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:18" (2/3) ... [2024-11-20 06:20:19,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b21b5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:20:19, skipping insertion in model container [2024-11-20 06:20:19,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:20:19" (3/3) ... [2024-11-20 06:20:19,860 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-10.i [2024-11-20 06:20:19,874 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:20:19,875 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:20:19,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:20:19,932 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;@20f2e51d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:20:19,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:20:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:20:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 06:20:19,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:19,954 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:19,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:19,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1721833162, now seen corresponding path program 1 times [2024-11-20 06:20:19,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:19,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566940495] [2024-11-20 06:20:19,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:19,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:20:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:20:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:20:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:20:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:20:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:20:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:20:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:20:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:20:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:20:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:20:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:20:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:20:20,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566940495] [2024-11-20 06:20:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566940495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:20:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826317965] [2024-11-20 06:20:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:20,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:20:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:20,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:20:20,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:20:20,651 INFO L87 Difference]: Start difference. First operand has 124 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:20:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:20,731 INFO L93 Difference]: Finished difference Result 241 states and 406 transitions. [2024-11-20 06:20:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:20:20,737 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 192 [2024-11-20 06:20:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:20,753 INFO L225 Difference]: With dead ends: 241 [2024-11-20 06:20:20,754 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 06:20:20,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-20 06:20:20,762 INFO L432 NwaCegarLoop]: 185 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, 185 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-20 06:20:20,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:20:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 06:20:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-20 06:20:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:20:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 185 transitions. [2024-11-20 06:20:20,802 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 185 transitions. Word has length 192 [2024-11-20 06:20:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:20,802 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 185 transitions. [2024-11-20 06:20:20,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:20:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 185 transitions. [2024-11-20 06:20:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 06:20:20,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:20,806 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:20,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:20:20,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:20,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1459171254, now seen corresponding path program 1 times [2024-11-20 06:20:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:20,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668635221] [2024-11-20 06:20:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:20:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:20:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:20:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:20:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:20:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:20:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:20:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:20:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:20:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:20:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:20:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:20:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:20:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668635221] [2024-11-20 06:20:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668635221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:20:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93424740] [2024-11-20 06:20:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:21,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:20:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:21,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:20:21,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:20:21,110 INFO L87 Difference]: Start difference. First operand 120 states and 185 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:20:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:21,184 INFO L93 Difference]: Finished difference Result 353 states and 547 transitions. [2024-11-20 06:20:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:20:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2024-11-20 06:20:21,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:21,191 INFO L225 Difference]: With dead ends: 353 [2024-11-20 06:20:21,192 INFO L226 Difference]: Without dead ends: 236 [2024-11-20 06:20:21,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-20 06:20:21,196 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 177 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:21,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 482 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:20:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-20 06:20:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 121. [2024-11-20 06:20:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:20:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 186 transitions. [2024-11-20 06:20:21,227 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 186 transitions. Word has length 192 [2024-11-20 06:20:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:21,229 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 186 transitions. [2024-11-20 06:20:21,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:20:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 186 transitions. [2024-11-20 06:20:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 06:20:21,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:21,237 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:21,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:20:21,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:21,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:21,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2045977268, now seen corresponding path program 1 times [2024-11-20 06:20:21,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:21,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945875604] [2024-11-20 06:20:21,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:21,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:20:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:20:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:20:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:20:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:20:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:20:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:20:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:20:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:20:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:20:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:20:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:20:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:20:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:21,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945875604] [2024-11-20 06:20:21,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945875604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:21,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:21,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:20:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078657184] [2024-11-20 06:20:21,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:21,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:20:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:20:21,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:20:21,571 INFO L87 Difference]: Start difference. First operand 121 states and 186 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:20:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:21,590 INFO L93 Difference]: Finished difference Result 239 states and 369 transitions. [2024-11-20 06:20:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:20:21,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2024-11-20 06:20:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:21,594 INFO L225 Difference]: With dead ends: 239 [2024-11-20 06:20:21,595 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 06:20:21,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-20 06:20:21,598 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:21,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:20:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 06:20:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-20 06:20:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:20:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 185 transitions. [2024-11-20 06:20:21,615 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 185 transitions. Word has length 192 [2024-11-20 06:20:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:21,616 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 185 transitions. [2024-11-20 06:20:21,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:20:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 185 transitions. [2024-11-20 06:20:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 06:20:21,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:21,621 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:21,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:20:21,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:21,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash -122749234, now seen corresponding path program 1 times [2024-11-20 06:20:21,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:21,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748646057] [2024-11-20 06:20:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:20:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:20:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:20:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:20:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:20:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:20:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:20:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:20:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:20:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:20:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:20:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:20:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:20:22,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:22,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748646057] [2024-11-20 06:20:22,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748646057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:22,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:22,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:20:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760026600] [2024-11-20 06:20:22,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:22,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:20:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:22,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:20:22,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:20:22,133 INFO L87 Difference]: Start difference. First operand 121 states and 185 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:20:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:22,359 INFO L93 Difference]: Finished difference Result 414 states and 636 transitions. [2024-11-20 06:20:22,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:20:22,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2024-11-20 06:20:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:22,363 INFO L225 Difference]: With dead ends: 414 [2024-11-20 06:20:22,364 INFO L226 Difference]: Without dead ends: 296 [2024-11-20 06:20:22,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:20:22,365 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 306 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:22,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 502 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:20:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-20 06:20:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2024-11-20 06:20:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 212 states have (on average 1.4386792452830188) internal successors, (305), 212 states have internal predecessors, (305), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:20:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 417 transitions. [2024-11-20 06:20:22,389 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 417 transitions. Word has length 192 [2024-11-20 06:20:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:22,390 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 417 transitions. [2024-11-20 06:20:22,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:20:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 417 transitions. [2024-11-20 06:20:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-20 06:20:22,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:22,393 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:22,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:20:22,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:22,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1564621807, now seen corresponding path program 1 times [2024-11-20 06:20:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:22,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611215134] [2024-11-20 06:20:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:20:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:20:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:20:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:20:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:20:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:20:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:20:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:20:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:20:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:20:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:20:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:20:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:20:22,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:22,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611215134] [2024-11-20 06:20:22,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611215134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:20:22,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196848012] [2024-11-20 06:20:22,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:22,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:22,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:22,931 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-20 06:20:22,932 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-20 06:20:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:23,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 06:20:23,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:20:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 231 proven. 75 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2024-11-20 06:20:23,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:20:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:20:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196848012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:20:23,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:20:23,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-20 06:20:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914222440] [2024-11-20 06:20:23,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:20:23,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:20:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:23,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:20:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:20:23,690 INFO L87 Difference]: Start difference. First operand 271 states and 417 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-11-20 06:20:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:23,917 INFO L93 Difference]: Finished difference Result 551 states and 841 transitions. [2024-11-20 06:20:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:20:23,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 194 [2024-11-20 06:20:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:23,920 INFO L225 Difference]: With dead ends: 551 [2024-11-20 06:20:23,920 INFO L226 Difference]: Without dead ends: 283 [2024-11-20 06:20:23,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:20:23,921 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 197 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:23,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 377 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:20:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-20 06:20:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2024-11-20 06:20:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 218 states have (on average 1.3990825688073394) internal successors, (305), 218 states have internal predecessors, (305), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:20:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 417 transitions. [2024-11-20 06:20:23,957 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 417 transitions. Word has length 194 [2024-11-20 06:20:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:23,958 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 417 transitions. [2024-11-20 06:20:23,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-11-20 06:20:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 417 transitions. [2024-11-20 06:20:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 06:20:23,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:23,959 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:23,968 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-20 06:20:24,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:24,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:24,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2079088397, now seen corresponding path program 1 times [2024-11-20 06:20:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:24,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298024568] [2024-11-20 06:20:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:20:24,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039942673] [2024-11-20 06:20:24,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:24,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:24,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:24,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:20:24,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 06:20:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:24,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-20 06:20:24,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:20:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 987 proven. 282 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-20 06:20:28,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:20:41,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:41,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298024568] [2024-11-20 06:20:41,609 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 06:20:41,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039942673] [2024-11-20 06:20:41,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039942673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:20:41,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 06:20:41,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2024-11-20 06:20:41,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332033483] [2024-11-20 06:20:41,609 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 06:20:41,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-20 06:20:41,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:41,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 06:20:41,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1078, Unknown=2, NotChecked=0, Total=1332 [2024-11-20 06:20:41,611 INFO L87 Difference]: Start difference. First operand 279 states and 417 transitions. Second operand has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-20 06:20:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:43,372 INFO L93 Difference]: Finished difference Result 591 states and 859 transitions. [2024-11-20 06:20:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-20 06:20:43,373 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 195 [2024-11-20 06:20:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:43,379 INFO L225 Difference]: With dead ends: 591 [2024-11-20 06:20:43,379 INFO L226 Difference]: Without dead ends: 315 [2024-11-20 06:20:43,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=430, Invalid=1548, Unknown=2, NotChecked=0, Total=1980 [2024-11-20 06:20:43,384 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 308 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:43,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1836 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 06:20:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-20 06:20:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 307. [2024-11-20 06:20:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 239 states have (on average 1.3598326359832635) internal successors, (325), 239 states have internal predecessors, (325), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:20:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 437 transitions. [2024-11-20 06:20:43,402 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 437 transitions. Word has length 195 [2024-11-20 06:20:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:43,403 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 437 transitions. [2024-11-20 06:20:43,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-20 06:20:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 437 transitions. [2024-11-20 06:20:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 06:20:43,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:43,405 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:43,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 06:20:43,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 06:20:43,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:43,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash 75102029, now seen corresponding path program 1 times [2024-11-20 06:20:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:43,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97769503] [2024-11-20 06:20:43,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:43,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:20:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:20:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:20:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:20:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:20:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:20:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:20:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:20:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:20:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:20:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:20:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:20:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:20:44,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:44,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97769503] [2024-11-20 06:20:44,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97769503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:20:44,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:20:44,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:20:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024325199] [2024-11-20 06:20:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:20:44,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:20:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:44,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:20:44,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:20:44,015 INFO L87 Difference]: Start difference. First operand 307 states and 437 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:20:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:44,349 INFO L93 Difference]: Finished difference Result 866 states and 1217 transitions. [2024-11-20 06:20:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:20:44,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2024-11-20 06:20:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:44,360 INFO L225 Difference]: With dead ends: 866 [2024-11-20 06:20:44,361 INFO L226 Difference]: Without dead ends: 731 [2024-11-20 06:20:44,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:20:44,365 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 206 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:44,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 548 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:20:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-20 06:20:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 522. [2024-11-20 06:20:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 395 states have (on average 1.3265822784810126) internal successors, (524), 397 states have internal predecessors, (524), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-20 06:20:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 732 transitions. [2024-11-20 06:20:44,431 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 732 transitions. Word has length 195 [2024-11-20 06:20:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:44,433 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 732 transitions. [2024-11-20 06:20:44,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:20:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 732 transitions. [2024-11-20 06:20:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 06:20:44,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:44,435 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:44,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:20:44,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:44,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash -945966325, now seen corresponding path program 1 times [2024-11-20 06:20:44,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:44,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78982005] [2024-11-20 06:20:44,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:44,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:20:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1296146995] [2024-11-20 06:20:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:44,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:44,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:44,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:20:44,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 06:20:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:44,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-20 06:20:44,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:20:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 983 proven. 192 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-20 06:20:47,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:20:49,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78982005] [2024-11-20 06:20:49,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 06:20:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296146995] [2024-11-20 06:20:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296146995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:20:49,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 06:20:49,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2024-11-20 06:20:49,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572751139] [2024-11-20 06:20:49,688 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 06:20:49,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 06:20:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:49,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 06:20:49,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2024-11-20 06:20:49,690 INFO L87 Difference]: Start difference. First operand 522 states and 732 transitions. Second operand has 25 states, 25 states have (on average 3.28) internal successors, (82), 22 states have internal predecessors, (82), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-20 06:20:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:51,364 INFO L93 Difference]: Finished difference Result 1260 states and 1778 transitions. [2024-11-20 06:20:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-20 06:20:51,365 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 22 states have internal predecessors, (82), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 195 [2024-11-20 06:20:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:51,370 INFO L225 Difference]: With dead ends: 1260 [2024-11-20 06:20:51,370 INFO L226 Difference]: Without dead ends: 1043 [2024-11-20 06:20:51,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2024-11-20 06:20:51,372 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 420 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:51,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 2029 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 06:20:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2024-11-20 06:20:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 592. [2024-11-20 06:20:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 461 states have (on average 1.3600867678958786) internal successors, (627), 462 states have internal predecessors, (627), 108 states have call successors, (108), 22 states have call predecessors, (108), 22 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 06:20:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 843 transitions. [2024-11-20 06:20:51,409 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 843 transitions. Word has length 195 [2024-11-20 06:20:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:51,409 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 843 transitions. [2024-11-20 06:20:51,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 22 states have internal predecessors, (82), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-20 06:20:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 843 transitions. [2024-11-20 06:20:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 06:20:51,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:51,411 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:51,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 06:20:51,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:51,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:51,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:51,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1088130266, now seen corresponding path program 1 times [2024-11-20 06:20:51,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71253505] [2024-11-20 06:20:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:20:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:20:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:20:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:20:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:20:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:20:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:20:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:20:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:20:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:20:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:20:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:20:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:20:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:20:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:20:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:20:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:20:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:20:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 06:20:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:20:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 06:20:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:20:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 06:20:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:20:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 06:20:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:20:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:20:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:20:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:20:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:20:51,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71253505] [2024-11-20 06:20:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71253505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:20:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624744971] [2024-11-20 06:20:51,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:51,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:51,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:51,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:20:51,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 06:20:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:20:52,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 06:20:52,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:20:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-20 06:20:52,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:20:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:20:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624744971] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:20:52,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:20:52,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-20 06:20:52,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261605872] [2024-11-20 06:20:52,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:20:52,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:20:52,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:20:52,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:20:52,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:20:52,334 INFO L87 Difference]: Start difference. First operand 592 states and 843 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 06:20:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:20:52,880 INFO L93 Difference]: Finished difference Result 1446 states and 2016 transitions. [2024-11-20 06:20:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 06:20:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2024-11-20 06:20:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:20:52,884 INFO L225 Difference]: With dead ends: 1446 [2024-11-20 06:20:52,885 INFO L226 Difference]: Without dead ends: 857 [2024-11-20 06:20:52,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 446 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2024-11-20 06:20:52,886 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 593 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:20:52,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 484 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:20:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-20 06:20:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 604. [2024-11-20 06:20:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 470 states have (on average 1.3382978723404255) internal successors, (629), 471 states have internal predecessors, (629), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 06:20:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 845 transitions. [2024-11-20 06:20:52,943 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 845 transitions. Word has length 196 [2024-11-20 06:20:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:20:52,944 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 845 transitions. [2024-11-20 06:20:52,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 06:20:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 845 transitions. [2024-11-20 06:20:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 06:20:52,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:20:52,946 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:20:52,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 06:20:53,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:53,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:20:53,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:20:53,147 INFO L85 PathProgramCache]: Analyzing trace with hash -408071896, now seen corresponding path program 1 times [2024-11-20 06:20:53,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:20:53,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762932592] [2024-11-20 06:20:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:20:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:20:53,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158948389] [2024-11-20 06:20:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:20:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:20:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:53,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:20:53,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 06:20:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:20:53,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:20:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:20:53,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:20:53,528 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:20:53,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:20:53,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 06:20:53,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 06:20:53,736 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:20:53,844 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:20:53,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:20:53 BoogieIcfgContainer [2024-11-20 06:20:53,847 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:20:53,847 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:20:53,847 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:20:53,848 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:20:53,848 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:20:19" (3/4) ... [2024-11-20 06:20:53,850 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:20:53,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:20:53,852 INFO L158 Benchmark]: Toolchain (without parser) took 35225.74ms. Allocated memory was 163.6MB in the beginning and 539.0MB in the end (delta: 375.4MB). Free memory was 91.9MB in the beginning and 394.5MB in the end (delta: -302.6MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2024-11-20 06:20:53,852 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:20:53,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.98ms. Allocated memory is still 163.6MB. Free memory was 91.8MB in the beginning and 73.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 06:20:53,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.64ms. Allocated memory was 163.6MB in the beginning and 257.9MB in the end (delta: 94.4MB). Free memory was 73.0MB in the beginning and 224.4MB in the end (delta: -151.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-11-20 06:20:53,852 INFO L158 Benchmark]: Boogie Preprocessor took 106.16ms. Allocated memory is still 257.9MB. Free memory was 224.4MB in the beginning and 215.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 06:20:53,853 INFO L158 Benchmark]: RCFGBuilder took 657.63ms. Allocated memory is still 257.9MB. Free memory was 215.0MB in the beginning and 175.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-20 06:20:53,853 INFO L158 Benchmark]: TraceAbstraction took 33993.65ms. Allocated memory was 257.9MB in the beginning and 539.0MB in the end (delta: 281.0MB). Free memory was 174.1MB in the beginning and 395.5MB in the end (delta: -221.4MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2024-11-20 06:20:53,853 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 539.0MB. Free memory was 395.5MB in the beginning and 394.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:20:53,854 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.21ms. Allocated memory is still 163.6MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.98ms. Allocated memory is still 163.6MB. Free memory was 91.8MB in the beginning and 73.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.64ms. Allocated memory was 163.6MB in the beginning and 257.9MB in the end (delta: 94.4MB). Free memory was 73.0MB in the beginning and 224.4MB in the end (delta: -151.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.16ms. Allocated memory is still 257.9MB. Free memory was 224.4MB in the beginning and 215.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 657.63ms. Allocated memory is still 257.9MB. Free memory was 215.0MB in the beginning and 175.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33993.65ms. Allocated memory was 257.9MB in the beginning and 539.0MB in the end (delta: 281.0MB). Free memory was 174.1MB in the beginning and 395.5MB in the end (delta: -221.4MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 539.0MB. Free memory was 395.5MB in the beginning and 394.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 200, overapproximation of bitwiseOr at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_7 = 10000; [L24] unsigned short int var_1_8 = 20453; [L25] signed short int var_1_10 = -5; [L26] unsigned char var_1_12 = 5; [L27] unsigned short int var_1_13 = 63501; [L28] unsigned char var_1_14 = 1; [L29] float var_1_15 = 16.25; [L30] float var_1_16 = 5.13; [L31] float var_1_17 = 99999999.25; [L32] signed char var_1_18 = 0; [L33] signed char var_1_19 = -4; [L34] signed char var_1_20 = 16; [L35] signed char var_1_21 = -100; [L36] float var_1_22 = 31.4; [L37] float var_1_23 = 16.432; [L38] float var_1_24 = 9999.5; [L39] unsigned long int var_1_26 = 100000000; [L40] unsigned short int var_1_27 = 50; [L41] float var_1_28 = 255.5; [L42] unsigned short int var_1_29 = 16; [L43] unsigned short int var_1_30 = 21823; [L44] float var_1_31 = 3.325; [L45] signed long int var_1_33 = 8; [L46] signed short int var_1_35 = -1; [L47] signed short int var_1_36 = 32549; [L48] unsigned char var_1_37 = 1; [L49] unsigned char var_1_38 = 0; [L50] unsigned char var_1_39 = 0; [L51] unsigned char var_1_40 = 128; [L52] unsigned char var_1_41 = 0; [L53] unsigned char last_1_var_1_12 = 5; [L54] unsigned long int last_1_var_1_26 = 100000000; [L55] signed short int last_1_var_1_35 = -1; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L195] last_1_var_1_12 = var_1_12 [L196] last_1_var_1_26 = var_1_26 [L197] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L149] var_1_7 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=20453] [L150] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=20453] [L151] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=20453] [L151] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=20453] [L152] var_1_8 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L153] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L154] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L154] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L155] var_1_13 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L156] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L157] CALL assume_abort_if_not(var_1_13 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L157] RET assume_abort_if_not(var_1_13 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L159] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L160] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L160] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L162] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L163] var_1_17 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L164] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L165] var_1_19 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L166] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L167] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L167] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L169] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L170] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L170] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L171] var_1_21 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L172] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L173] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L173] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L174] var_1_23 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L175] RET assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L176] var_1_24 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L177] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L178] var_1_28 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L179] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L180] CALL assume_abort_if_not(var_1_28 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L180] RET assume_abort_if_not(var_1_28 != 0.0F) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L181] var_1_30 = __VERIFIER_nondet_ushort() [L182] CALL assume_abort_if_not(var_1_30 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L182] RET assume_abort_if_not(var_1_30 >= 16384) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L183] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L183] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L184] var_1_36 = __VERIFIER_nondet_short() [L185] CALL assume_abort_if_not(var_1_36 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L185] RET assume_abort_if_not(var_1_36 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L186] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L186] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L187] var_1_38 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L188] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L189] CALL assume_abort_if_not(var_1_38 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L189] RET assume_abort_if_not(var_1_38 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L190] var_1_39 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L191] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L192] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L192] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L208] RET updateVariables() [L209] CALL step() [L59] EXPR last_1_var_1_12 | last_1_var_1_35 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L59] signed long int stepLocal_5 = last_1_var_1_12 | last_1_var_1_35; [L60] COND TRUE var_1_16 >= (var_1_17 / var_1_28) [L61] var_1_27 = (last_1_var_1_26 + var_1_14) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L67] signed long int stepLocal_2 = 4 + var_1_13; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_2=32771, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L68] COND FALSE !((16 / -5) >= stepLocal_2) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L71] var_1_40 = var_1_14 [L72] var_1_10 = (var_1_40 - var_1_40) [L73] unsigned char stepLocal_1 = var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_1=1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L74] COND FALSE !(stepLocal_1 >= 4) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L81] COND FALSE !(var_1_8 <= var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L84] unsigned short int stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_4=-311297, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L85] COND TRUE stepLocal_4 >= var_1_40 [L86] var_1_26 = var_1_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L88] unsigned long int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_0=8191, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L89] COND FALSE !(stepLocal_0 <= 32) [L94] var_1_1 = ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L96] COND TRUE var_1_24 < var_1_16 [L97] var_1_33 = (var_1_30 + ((var_1_1 + var_1_27) - 10)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L99] unsigned short int stepLocal_10 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L100] COND FALSE !(var_1_15 > (var_1_23 / var_1_28)) [L107] var_1_41 = var_1_38 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L109] signed short int stepLocal_9 = var_1_36; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, stepLocal_9=16383, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L110] COND TRUE stepLocal_9 <= var_1_30 [L111] var_1_37 = ((! var_1_41) && var_1_38) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L115] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L118] COND FALSE !(\read(var_1_37)) [L121] var_1_29 = ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L123] unsigned char stepLocal_8 = var_1_37; [L124] unsigned short int stepLocal_7 = var_1_13; [L125] signed long int stepLocal_6 = - var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, stepLocal_6=-1, stepLocal_7=32767, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L126] COND TRUE (var_1_40 / var_1_8) <= stepLocal_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, stepLocal_6=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=133/40, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L127] COND FALSE !(var_1_14 == stepLocal_6) [L132] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L137] signed long int stepLocal_3 = (var_1_7 * var_1_12) * (var_1_29 * var_1_12); VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_3=6709657650, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L138] COND FALSE !(stepLocal_3 == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L141] COND FALSE !(\read(var_1_41)) [L144] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-311297, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L209] RET step() [L210] CALL, EXPR property() [L200] EXPR ((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L200] EXPR (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L200-L201] return (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=32766, var_1_30=16384, var_1_31=2, var_1_33=90358, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=1, var_1_41=0, var_1_7=204799, var_1_8=-311297] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.8s, OverallIterations: 10, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2211 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2207 mSDsluCounter, 6806 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5020 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3427 IncrementalHoareTripleChecker+Invalid, 3955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 1786 mSDtfsCounter, 3427 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1721 GetRequests, 1604 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=604occurred in iteration=9, InterpolantAutomatonStates: 97, 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, 9 MinimizatonAttempts, 1065 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 2915 NumberOfCodeBlocks, 2915 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2510 ConstructedInterpolants, 7 QuantifiedInterpolants, 13932 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1831 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 18939/19656 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-20 06:20:53,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.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 432664c2eda1030555a8d42748674a5f8f3357a27417c048e2327859bae46f10 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:20:55,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:20:55,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:20:55,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:20:55,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:20:55,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:20:55,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:20:55,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:20:55,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:20:55,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:20:55,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:20:55,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:20:55,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:20:55,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:20:55,849 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:20:55,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:20:55,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:20:55,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:20:55,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:20:55,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:20:55,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:20:55,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:20:55,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:20:55,853 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:20:55,854 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:20:55,854 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:20:55,854 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:20:55,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:20:55,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:20:55,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:20:55,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:20:55,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:20:55,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:20:55,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:20:55,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:20:55,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:20:55,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:20:55,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:20:55,857 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:20:55,858 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:20:55,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:20:55,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:20:55,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:20:55,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:20:55,858 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 -> 432664c2eda1030555a8d42748674a5f8f3357a27417c048e2327859bae46f10 [2024-11-20 06:20:56,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:20:56,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:20:56,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:20:56,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:20:56,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:20:56,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i [2024-11-20 06:20:57,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:20:57,701 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:20:57,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-10.i [2024-11-20 06:20:57,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcf964f5/455362fa6c7b4b5e8470511379d20ad3/FLAG6202f4820 [2024-11-20 06:20:57,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcf964f5/455362fa6c7b4b5e8470511379d20ad3 [2024-11-20 06:20:57,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:20:57,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:20:57,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:20:57,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:20:57,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:20:57,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:20:57" (1/1) ... [2024-11-20 06:20:57,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a71cff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:57, skipping insertion in model container [2024-11-20 06:20:57,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:20:57" (1/1) ... [2024-11-20 06:20:57,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:20:57,939 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_loopvsstraightlinecode_100-while_file-10.i[916,929] [2024-11-20 06:20:58,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:20:58,031 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:20:58,043 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_loopvsstraightlinecode_100-while_file-10.i[916,929] [2024-11-20 06:20:58,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:20:58,106 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:20:58,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58 WrapperNode [2024-11-20 06:20:58,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:20:58,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:20:58,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:20:58,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:20:58,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,154 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-20 06:20:58,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:20:58,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:20:58,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:20:58,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:20:58,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,176 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-20 06:20:58,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:20:58,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:20:58,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:20:58,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:20:58,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (1/1) ... [2024-11-20 06:20:58,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:20:58,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:20:58,242 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-20 06:20:58,255 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-20 06:20:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:20:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:20:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:20:58,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:20:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:20:58,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:20:58,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:20:58,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:21:03,608 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-20 06:21:03,609 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:21:03,626 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:21:03,626 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:21:03,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:21:03 BoogieIcfgContainer [2024-11-20 06:21:03,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:21:03,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:21:03,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:21:03,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:21:03,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:20:57" (1/3) ... [2024-11-20 06:21:03,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c57679e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:21:03, skipping insertion in model container [2024-11-20 06:21:03,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:20:58" (2/3) ... [2024-11-20 06:21:03,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c57679e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:21:03, skipping insertion in model container [2024-11-20 06:21:03,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:21:03" (3/3) ... [2024-11-20 06:21:03,635 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-10.i [2024-11-20 06:21:03,649 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:21:03,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:21:03,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:21:03,706 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;@581e5a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:21:03,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:21:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:21:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 06:21:03,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:21:03,723 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:21:03,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:21:03,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:21:03,728 INFO L85 PathProgramCache]: Analyzing trace with hash -666781085, now seen corresponding path program 1 times [2024-11-20 06:21:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:21:03,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733692069] [2024-11-20 06:21:03,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:21:03,740 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-20 06:21:03,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:21:03,743 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-20 06:21:03,744 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-20 06:21:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:21:04,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:21:04,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:21:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-20 06:21:04,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:21:04,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:21:04,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733692069] [2024-11-20 06:21:04,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733692069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:21:04,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:21:04,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:21:04,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354178208] [2024-11-20 06:21:04,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:21:04,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:21:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:21:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:21:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:21:04,489 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:21:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:21:04,518 INFO L93 Difference]: Finished difference Result 175 states and 304 transitions. [2024-11-20 06:21:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:21:04,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-20 06:21:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:21:04,526 INFO L225 Difference]: With dead ends: 175 [2024-11-20 06:21:04,526 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 06:21:04,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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-20 06:21:04,531 INFO L432 NwaCegarLoop]: 133 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, 133 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-20 06:21:04,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:21:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 06:21:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-20 06:21:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:21:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2024-11-20 06:21:04,574 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 186 [2024-11-20 06:21:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:21:04,574 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-11-20 06:21:04,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:21:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2024-11-20 06:21:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 06:21:04,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:21:04,577 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:21:04,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 06:21:04,781 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-20 06:21:04,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:21:04,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:21:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1641059299, now seen corresponding path program 1 times [2024-11-20 06:21:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:21:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027348757] [2024-11-20 06:21:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:21:04,785 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-20 06:21:04,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:21:04,788 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-20 06:21:04,790 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-20 06:21:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:21:05,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 06:21:05,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:21:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:21:05,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:21:05,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:21:05,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027348757] [2024-11-20 06:21:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027348757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:21:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:21:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:21:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296581458] [2024-11-20 06:21:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:21:05,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:21:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:21:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:21:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:21:05,446 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:21:09,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-20 06:21:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:21:09,590 INFO L93 Difference]: Finished difference Result 171 states and 263 transitions. [2024-11-20 06:21:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:21:09,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-20 06:21:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:21:09,637 INFO L225 Difference]: With dead ends: 171 [2024-11-20 06:21:09,637 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 06:21:09,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 184 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-20 06:21:09,639 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:21:09,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-20 06:21:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 06:21:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-20 06:21:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:21:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-11-20 06:21:09,667 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 186 [2024-11-20 06:21:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:21:09,669 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-11-20 06:21:09,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:21:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-11-20 06:21:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 06:21:09,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:21:09,671 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:21:09,690 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 (3)] Forceful destruction successful, exit code 0 [2024-11-20 06:21:09,876 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-20 06:21:09,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:21:09,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:21:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash -164379035, now seen corresponding path program 1 times [2024-11-20 06:21:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:21:09,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369499211] [2024-11-20 06:21:09,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:21:09,881 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-20 06:21:09,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:21:09,885 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-20 06:21:09,887 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-20 06:21:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:21:10,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 06:21:10,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:21:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-20 06:21:11,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:21:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:21:12,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:21:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369499211] [2024-11-20 06:21:12,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369499211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:21:12,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:21:12,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-20 06:21:12,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421170944] [2024-11-20 06:21:12,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:21:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:21:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:21:12,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:21:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:21:12,428 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 06:21:18,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:21:22,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:21:26,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:21:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:21:28,068 INFO L93 Difference]: Finished difference Result 271 states and 404 transitions. [2024-11-20 06:21:28,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 06:21:28,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 186 [2024-11-20 06:21:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:21:28,073 INFO L225 Difference]: With dead ends: 271 [2024-11-20 06:21:28,073 INFO L226 Difference]: Without dead ends: 187 [2024-11-20 06:21:28,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-20 06:21:28,075 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 253 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 110 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-20 06:21:28,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 486 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 371 Invalid, 2 Unknown, 0 Unchecked, 14.9s Time] [2024-11-20 06:21:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-20 06:21:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 93. [2024-11-20 06:21:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:21:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-20 06:21:28,100 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 186 [2024-11-20 06:21:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:21:28,101 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-20 06:21:28,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 06:21:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-20 06:21:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 06:21:28,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:21:28,106 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:21:28,129 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-20 06:21:28,307 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-20 06:21:28,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:21:28,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:21:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash 122652325, now seen corresponding path program 1 times [2024-11-20 06:21:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:21:28,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609850991] [2024-11-20 06:21:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:21:28,313 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-20 06:21:28,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:21:28,315 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-20 06:21:28,316 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-20 06:21:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:21:28,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 06:21:28,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:21:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 207 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-20 06:21:34,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:21:35,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:21:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609850991] [2024-11-20 06:21:35,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609850991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:21:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [85892659] [2024-11-20 06:21:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:21:35,827 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:21:35,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:21:35,830 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-20 06:21:35,831 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-20 06:21:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:21:37,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 06:21:37,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:21:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 207 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-20 06:21:42,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:21:43,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [85892659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:21:43,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:21:43,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-11-20 06:21:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295048454] [2024-11-20 06:21:43,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:21:43,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:21:43,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:21:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:21:43,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-20 06:21:43,702 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28)