./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.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 a5a79563eebf4c0adb85c657f2e56816668e0af593ca846b35361e1efa1ac928 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:48:56,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:48:57,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:48:57,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:48:57,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:48:57,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:48:57,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:48:57,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:48:57,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:48:57,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:48:57,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:48:57,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:48:57,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:48:57,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:48:57,095 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:48:57,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:48:57,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:48:57,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:48:57,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:48:57,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:48:57,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:48:57,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:48:57,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:48:57,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:48:57,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:48:57,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:48:57,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:48:57,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:48:57,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:48:57,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:48:57,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:48:57,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:48:57,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:48:57,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:48:57,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:48:57,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:48:57,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:48:57,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:48:57,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:48:57,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:48:57,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:48:57,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:48:57,108 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 -> a5a79563eebf4c0adb85c657f2e56816668e0af593ca846b35361e1efa1ac928 [2024-11-10 05:48:57,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:48:57,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:48:57,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:48:57,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:48:57,409 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:48:57,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2024-11-10 05:48:58,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:48:59,155 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:48:59,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2024-11-10 05:48:59,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5446d3035/7e646e06df1747c69211ca7dd8285b88/FLAGd7ca85a86 [2024-11-10 05:48:59,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5446d3035/7e646e06df1747c69211ca7dd8285b88 [2024-11-10 05:48:59,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:48:59,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:48:59,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:48:59,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:48:59,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:48:59,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2401cab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59, skipping insertion in model container [2024-11-10 05:48:59,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:48:59,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i[919,932] [2024-11-10 05:48:59,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:48:59,621 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:48:59,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i[919,932] [2024-11-10 05:48:59,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:48:59,701 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:48:59,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59 WrapperNode [2024-11-10 05:48:59,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:48:59,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:48:59,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:48:59,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:48:59,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,765 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-10 05:48:59,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:48:59,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:48:59,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:48:59,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:48:59,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,825 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:48:59,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:48:59,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:48:59,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:48:59,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:48:59,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (1/1) ... [2024-11-10 05:48:59,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:48:59,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:48:59,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:48:59,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:48:59,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:48:59,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:48:59,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:48:59,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:48:59,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:48:59,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:49:00,051 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:49:00,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:49:00,516 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 05:49:00,516 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:49:00,543 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:49:00,545 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:49:00,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:49:00 BoogieIcfgContainer [2024-11-10 05:49:00,545 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:49:00,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:49:00,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:49:00,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:49:00,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:48:59" (1/3) ... [2024-11-10 05:49:00,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5a55fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:49:00, skipping insertion in model container [2024-11-10 05:49:00,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:59" (2/3) ... [2024-11-10 05:49:00,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5a55fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:49:00, skipping insertion in model container [2024-11-10 05:49:00,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:49:00" (3/3) ... [2024-11-10 05:49:00,557 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2024-11-10 05:49:00,577 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:49:00,577 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:49:00,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:49:00,664 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;@36b9138, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:49:00,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:49:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:49:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 05:49:00,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:00,690 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:00,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:00,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash 708020031, now seen corresponding path program 1 times [2024-11-10 05:49:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:49:00,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745139843] [2024-11-10 05:49:00,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:49:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:49:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:49:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:49:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:49:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:49:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:49:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:49:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:49:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 05:49:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:49:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 05:49:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:49:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:49:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:49:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:49:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:49:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:49:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:49:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:49:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:49:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:49:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:49:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:49:01,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:49:01,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745139843] [2024-11-10 05:49:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745139843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:49:01,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:49:01,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:49:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679729376] [2024-11-10 05:49:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:49:01,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:49:01,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:49:01,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:49:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:49:01,301 INFO L87 Difference]: Start difference. First operand has 85 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:49:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:49:01,345 INFO L93 Difference]: Finished difference Result 162 states and 273 transitions. [2024-11-10 05:49:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:49:01,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2024-11-10 05:49:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:49:01,362 INFO L225 Difference]: With dead ends: 162 [2024-11-10 05:49:01,363 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 05:49:01,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:49:01,375 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:49:01,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:49:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 05:49:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-10 05:49:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:49:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-10 05:49:01,436 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 155 [2024-11-10 05:49:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:49:01,438 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-10 05:49:01,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:49:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-10 05:49:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 05:49:01,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:01,442 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:01,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:49:01,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:01,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash -909875323, now seen corresponding path program 1 times [2024-11-10 05:49:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:49:01,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128895407] [2024-11-10 05:49:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:49:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:49:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:49:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:49:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:49:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:49:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:49:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:49:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:49:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 05:49:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:49:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 05:49:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:49:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:49:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:49:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:49:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:49:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:49:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:49:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:49:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:49:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:49:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:49:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:49:01,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:49:01,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128895407] [2024-11-10 05:49:01,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128895407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:49:01,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:49:01,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:49:01,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616278083] [2024-11-10 05:49:01,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:49:01,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:49:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:49:01,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:49:01,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:49:01,996 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:49:02,195 INFO L93 Difference]: Finished difference Result 204 states and 303 transitions. [2024-11-10 05:49:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:49:02,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-10 05:49:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:49:02,199 INFO L225 Difference]: With dead ends: 204 [2024-11-10 05:49:02,200 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 05:49:02,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:49:02,204 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 59 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:49:02,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 380 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:49:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 05:49:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2024-11-10 05:49:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 87 states have internal predecessors, (114), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 05:49:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 182 transitions. [2024-11-10 05:49:02,238 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 182 transitions. Word has length 156 [2024-11-10 05:49:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:49:02,239 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 182 transitions. [2024-11-10 05:49:02,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 182 transitions. [2024-11-10 05:49:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 05:49:02,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:02,242 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:02,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:49:02,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:02,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1318699548, now seen corresponding path program 1 times [2024-11-10 05:49:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:49:02,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92055489] [2024-11-10 05:49:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:49:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:49:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:49:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:49:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:49:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:49:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:49:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:49:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:49:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 05:49:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:49:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 05:49:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:49:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:49:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:49:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:49:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:49:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:49:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:49:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:49:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:49:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:49:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:49:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:49:02,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:49:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92055489] [2024-11-10 05:49:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92055489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:49:02,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:49:02,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:49:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244083632] [2024-11-10 05:49:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:49:02,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:49:02,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:49:02,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:49:02,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:49:02,577 INFO L87 Difference]: Start difference. First operand 123 states and 182 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:49:02,617 INFO L93 Difference]: Finished difference Result 243 states and 361 transitions. [2024-11-10 05:49:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:49:02,620 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-10 05:49:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:49:02,627 INFO L225 Difference]: With dead ends: 243 [2024-11-10 05:49:02,629 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 05:49:02,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:49:02,632 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:49:02,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:49:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 05:49:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-10 05:49:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.302325581395349) internal successors, (112), 87 states have internal predecessors, (112), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 05:49:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-11-10 05:49:02,657 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 156 [2024-11-10 05:49:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:49:02,658 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-11-10 05:49:02,658 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-11-10 05:49:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 05:49:02,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:02,662 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:02,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:49:02,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1824258173, now seen corresponding path program 1 times [2024-11-10 05:49:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:49:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126422271] [2024-11-10 05:49:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:49:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:49:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:49:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:49:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:49:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:49:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:49:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:49:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:49:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 05:49:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:49:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 05:49:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:49:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:49:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:49:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:49:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:49:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:49:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:49:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:49:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:49:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:49:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:49:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-10 05:49:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:49:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126422271] [2024-11-10 05:49:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126422271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:49:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899782226] [2024-11-10 05:49:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:03,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:49:03,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:49:03,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:49:03,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 05:49:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:03,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 05:49:03,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:49:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 441 proven. 21 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2024-11-10 05:49:03,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:49:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-10 05:49:03,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899782226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:49:03,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:49:03,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2024-11-10 05:49:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967435799] [2024-11-10 05:49:03,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:49:03,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 05:49:03,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:49:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 05:49:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:49:03,931 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2024-11-10 05:49:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:49:04,513 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2024-11-10 05:49:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 05:49:04,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 156 [2024-11-10 05:49:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:49:04,518 INFO L225 Difference]: With dead ends: 267 [2024-11-10 05:49:04,518 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 05:49:04,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2024-11-10 05:49:04,520 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 182 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:49:04,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 174 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:49:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 05:49:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2024-11-10 05:49:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 97 states have internal predecessors, (115), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 05:49:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2024-11-10 05:49:04,539 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 156 [2024-11-10 05:49:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:49:04,540 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2024-11-10 05:49:04,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2024-11-10 05:49:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2024-11-10 05:49:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 05:49:04,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:04,543 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:04,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 05:49:04,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:49:04,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:04,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash -181217211, now seen corresponding path program 1 times [2024-11-10 05:49:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:49:04,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711165839] [2024-11-10 05:49:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:49:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:49:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:49:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:49:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:49:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:49:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:49:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:49:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:49:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 05:49:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:49:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 05:49:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:49:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:49:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:49:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:49:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:49:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:49:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:49:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:49:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:49:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:49:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:49:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:49:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:49:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711165839] [2024-11-10 05:49:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711165839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:49:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:49:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:49:05,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132861079] [2024-11-10 05:49:05,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:49:05,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:49:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:49:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:49:05,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:49:05,153 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:49:05,272 INFO L93 Difference]: Finished difference Result 364 states and 489 transitions. [2024-11-10 05:49:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:49:05,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-10 05:49:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:49:05,276 INFO L225 Difference]: With dead ends: 364 [2024-11-10 05:49:05,276 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 05:49:05,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:49:05,277 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 69 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:49:05,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 332 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:49:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 05:49:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2024-11-10 05:49:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 160 states have (on average 1.21875) internal successors, (195), 163 states have internal predecessors, (195), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 05:49:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 291 transitions. [2024-11-10 05:49:05,323 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 291 transitions. Word has length 156 [2024-11-10 05:49:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:49:05,325 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 291 transitions. [2024-11-10 05:49:05,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 291 transitions. [2024-11-10 05:49:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 05:49:05,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:05,331 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:05,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:49:05,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:05,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2008687043, now seen corresponding path program 1 times [2024-11-10 05:49:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:49:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248275969] [2024-11-10 05:49:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:49:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:49:05,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969423687] [2024-11-10 05:49:05,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:05,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:49:05,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:49:05,441 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-10 05:49:05,443 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-10 05:49:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:49:06,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:49:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:49:06,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:49:06,285 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:49:06,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:49:06,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 05:49:06,488 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-10 05:49:06,491 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 05:49:06,625 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:49:06,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:49:06 BoogieIcfgContainer [2024-11-10 05:49:06,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:49:06,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:49:06,632 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:49:06,632 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:49:06,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:49:00" (3/4) ... [2024-11-10 05:49:06,635 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:49:06,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:49:06,637 INFO L158 Benchmark]: Toolchain (without parser) took 7447.66ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 104.8MB in the beginning and 154.5MB in the end (delta: -49.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:49:06,638 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:49:06,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.87ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 136.4MB in the end (delta: -31.8MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-10 05:49:06,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.04ms. Allocated memory is still 176.2MB. Free memory was 136.4MB in the beginning and 132.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:49:06,638 INFO L158 Benchmark]: Boogie Preprocessor took 96.21ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 124.9MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 05:49:06,639 INFO L158 Benchmark]: IcfgBuilder took 681.62ms. Allocated memory is still 176.2MB. Free memory was 124.9MB in the beginning and 96.6MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 05:49:06,639 INFO L158 Benchmark]: TraceAbstraction took 6077.80ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 95.9MB in the beginning and 154.5MB in the end (delta: -58.6MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2024-11-10 05:49:06,639 INFO L158 Benchmark]: Witness Printer took 5.38ms. Allocated memory is still 216.0MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:49:06,641 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 109.1MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.87ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 136.4MB in the end (delta: -31.8MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.04ms. Allocated memory is still 176.2MB. Free memory was 136.4MB in the beginning and 132.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.21ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 124.9MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 681.62ms. Allocated memory is still 176.2MB. Free memory was 124.9MB in the beginning and 96.6MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6077.80ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 95.9MB in the beginning and 154.5MB in the end (delta: -58.6MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Witness Printer took 5.38ms. Allocated memory is still 216.0MB. Free memory is still 154.5MB. 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 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned char var_1_33 = 8; [L42] unsigned long int var_1_34 = 50; [L43] double var_1_35 = 31.1; [L44] double var_1_36 = 127.4; [L45] unsigned long int var_1_37 = 64; [L46] signed long int var_1_38 = 8; [L47] float var_1_39 = 200.6; [L48] unsigned short int var_1_40 = 2; [L49] signed char var_1_42 = -4; [L50] double var_1_43 = 2.75; [L51] double var_1_44 = 7.6; [L52] signed char var_1_45 = 32; [L53] unsigned long int var_1_46 = 32; [L54] signed long int var_1_47 = -256; [L55] unsigned char last_1_var_1_9 = 1; [L56] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L166] last_1_var_1_9 = var_1_9 [L167] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_short() [L131] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L131] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L132] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L133] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L134] var_1_8 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_9=1] [L135] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L137] var_1_10 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L140] var_1_11 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L145] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L145] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L146] var_1_20 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L148] var_1_28 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L151] var_1_29 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L154] var_1_33 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L155] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L159] var_1_39 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L161] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L162] var_1_44 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L178] RET updateVariables() [L179] CALL step() [L60] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L67] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L69] COND TRUE var_1_9 || var_1_9 [L70] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L72] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L73] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L74] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L76] COND FALSE !(var_1_9 && var_1_9) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L79] var_1_35 = var_1_36 [L80] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L81] COND FALSE !((var_1_9 && var_1_9) && (var_1_26 > var_1_21)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L84] EXPR var_1_21 | var_1_26 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L84] COND FALSE !(var_1_28 > (var_1_21 | var_1_26)) [L87] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L90] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L92] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L93] COND FALSE !((((((var_1_36 / var_1_39)) > (var_1_24)) ? ((var_1_36 / var_1_39)) : (var_1_24))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L98] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L99] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L102] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L106] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L107] var_1_46 = var_1_33 [L108] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L109] COND FALSE !(var_1_28 > var_1_26) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L114] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L115] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L116] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L120] COND FALSE !(var_1_26 > ((var_1_29 >> 1) + var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=0] [L123] var_1_47 = var_1_21 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=23370, var_1_4=2, var_1_8=0, var_1_9=0] [L124] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=23370, var_1_4=2, var_1_8=0, var_1_9=0] [L127] var_1_45 = var_1_28 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=23370, var_1_4=2, var_1_8=0, var_1_9=0] [L179] RET step() [L180] CALL, EXPR property() [L170-L171] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=23370, var_1_4=2, var_1_8=0, var_1_9=0] [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=23370, var_1_4=2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_33=0, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=23370, var_1_4=2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310 mSDsluCounter, 1235 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 644 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 591 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 559 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1247 NumberOfCodeBlocks, 1247 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1084 ConstructedInterpolants, 0 QuantifiedInterpolants, 1743 SizeOfPredicates, 3 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6387/6468 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 05:49:06,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.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 a5a79563eebf4c0adb85c657f2e56816668e0af593ca846b35361e1efa1ac928 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:49:09,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:49:09,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:49:09,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:49:09,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:49:09,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:49:09,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:49:09,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:49:09,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:49:09,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:49:09,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:49:09,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:49:09,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:49:09,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:49:09,286 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:49:09,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:49:09,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:49:09,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:49:09,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:49:09,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:49:09,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:49:09,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:49:09,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:49:09,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:49:09,295 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:49:09,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:49:09,295 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:49:09,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:49:09,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:49:09,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:49:09,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:49:09,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:49:09,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:49:09,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:49:09,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:49:09,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:49:09,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:49:09,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:49:09,300 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:49:09,300 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:49:09,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:49:09,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:49:09,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:49:09,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:49:09,301 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 -> a5a79563eebf4c0adb85c657f2e56816668e0af593ca846b35361e1efa1ac928 [2024-11-10 05:49:09,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:49:09,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:49:09,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:49:09,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:49:09,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:49:09,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2024-11-10 05:49:11,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:49:11,588 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:49:11,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2024-11-10 05:49:11,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555348362/f364f84390e34a2286d65be47016c0c8/FLAG922c809cb [2024-11-10 05:49:11,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555348362/f364f84390e34a2286d65be47016c0c8 [2024-11-10 05:49:11,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:49:11,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:49:11,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:49:11,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:49:11,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:49:11,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:49:11" (1/1) ... [2024-11-10 05:49:11,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6432a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:11, skipping insertion in model container [2024-11-10 05:49:11,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:49:11" (1/1) ... [2024-11-10 05:49:11,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:49:11,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i[919,932] [2024-11-10 05:49:12,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:49:12,041 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:49:12,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i[919,932] [2024-11-10 05:49:12,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:49:12,131 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:49:12,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12 WrapperNode [2024-11-10 05:49:12,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:49:12,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:49:12,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:49:12,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:49:12,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,198 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-10 05:49:12,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:49:12,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:49:12,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:49:12,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:49:12,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,251 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:49:12,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:49:12,282 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:49:12,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:49:12,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:49:12,290 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (1/1) ... [2024-11-10 05:49:12,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:49:12,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:49:12,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:49:12,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:49:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:49:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:49:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:49:12,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:49:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:49:12,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:49:12,496 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:49:12,499 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:49:22,293 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 05:49:22,295 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:49:22,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:49:22,308 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:49:22,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:49:22 BoogieIcfgContainer [2024-11-10 05:49:22,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:49:22,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:49:22,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:49:22,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:49:22,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:49:11" (1/3) ... [2024-11-10 05:49:22,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbe52b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:49:22, skipping insertion in model container [2024-11-10 05:49:22,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:12" (2/3) ... [2024-11-10 05:49:22,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbe52b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:49:22, skipping insertion in model container [2024-11-10 05:49:22,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:49:22" (3/3) ... [2024-11-10 05:49:22,317 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-40.i [2024-11-10 05:49:22,332 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:49:22,333 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:49:22,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:49:22,411 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;@7e31ed22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:49:22,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:49:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:49:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 05:49:22,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:22,427 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:22,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:22,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1025648884, now seen corresponding path program 1 times [2024-11-10 05:49:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:49:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852480062] [2024-11-10 05:49:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:22,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:49:22,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:49:22,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:49:22,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 05:49:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:23,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:49:23,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:49:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-11-10 05:49:23,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:49:23,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:49:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852480062] [2024-11-10 05:49:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852480062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:49:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:49:23,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:49:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584274291] [2024-11-10 05:49:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:49:23,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:49:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:49:23,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:49:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:49:23,459 INFO L87 Difference]: Start difference. First operand has 82 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:49:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:49:23,493 INFO L93 Difference]: Finished difference Result 156 states and 263 transitions. [2024-11-10 05:49:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:49:23,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2024-11-10 05:49:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:49:23,501 INFO L225 Difference]: With dead ends: 156 [2024-11-10 05:49:23,501 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 05:49:23,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:49:23,508 INFO L432 NwaCegarLoop]: 115 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, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:49:23,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:49:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 05:49:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-10 05:49:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:49:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-10 05:49:23,558 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 154 [2024-11-10 05:49:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:49:23,559 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-10 05:49:23,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 05:49:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-10 05:49:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 05:49:23,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:23,564 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:23,590 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-10 05:49:23,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:49:23,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:23,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash -57461604, now seen corresponding path program 1 times [2024-11-10 05:49:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:49:23,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257480771] [2024-11-10 05:49:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:23,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:49:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:49:23,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:49:23,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 05:49:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:24,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 05:49:24,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:49:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 453 proven. 39 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-10 05:49:26,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:49:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-10 05:49:29,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:49:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257480771] [2024-11-10 05:49:29,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257480771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:49:29,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:49:29,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 05:49:29,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399300768] [2024-11-10 05:49:29,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:49:29,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:49:29,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:49:29,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:49:29,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:49:29,202 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 05:49:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:49:31,297 INFO L93 Difference]: Finished difference Result 157 states and 230 transitions. [2024-11-10 05:49:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:49:31,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 155 [2024-11-10 05:49:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:49:31,331 INFO L225 Difference]: With dead ends: 157 [2024-11-10 05:49:31,332 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 05:49:31,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:49:31,334 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:49:31,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 199 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 05:49:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 05:49:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-11-10 05:49:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:49:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2024-11-10 05:49:31,395 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 155 [2024-11-10 05:49:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:49:31,396 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. [2024-11-10 05:49:31,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 05:49:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2024-11-10 05:49:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 05:49:31,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:31,401 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:31,428 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-10 05:49:31,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:49:31,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:31,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash -901933475, now seen corresponding path program 1 times [2024-11-10 05:49:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:49:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668394730] [2024-11-10 05:49:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:31,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:49:31,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:49:31,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:49:31,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 05:49:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:32,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:49:32,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:49:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:49:32,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:49:32,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:49:32,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668394730] [2024-11-10 05:49:32,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668394730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:49:32,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:49:32,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:49:32,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013394791] [2024-11-10 05:49:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:49:32,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:49:32,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:49:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:49:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:49:32,662 INFO L87 Difference]: Start difference. First operand 79 states and 112 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:49:33,003 INFO L93 Difference]: Finished difference Result 155 states and 221 transitions. [2024-11-10 05:49:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:49:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-10 05:49:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:49:33,019 INFO L225 Difference]: With dead ends: 155 [2024-11-10 05:49:33,019 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 05:49:33,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:49:33,027 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 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.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:49:33,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:49:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 05:49:33,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 05:49:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 05:49:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2024-11-10 05:49:33,043 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 155 [2024-11-10 05:49:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:49:33,044 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2024-11-10 05:49:33,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2024-11-10 05:49:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 05:49:33,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:33,050 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:33,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 05:49:33,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:49:33,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:33,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1407492100, now seen corresponding path program 1 times [2024-11-10 05:49:33,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:49:33,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377459343] [2024-11-10 05:49:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:33,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:49:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:49:33,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:49:33,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 05:49:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:34,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 05:49:34,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:49:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 528 proven. 75 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2024-11-10 05:49:41,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:49:43,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:49:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377459343] [2024-11-10 05:49:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377459343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:49:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1927154383] [2024-11-10 05:49:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:43,651 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:49:43,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:49:43,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:49:43,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-10 05:49:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:47,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:49:47,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:49:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 441 proven. 21 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2024-11-10 05:49:49,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:49:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 05:49:51,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1927154383] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 05:49:51,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:49:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 7] total 16 [2024-11-10 05:49:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890333881] [2024-11-10 05:49:51,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:49:51,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:49:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:49:51,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:49:51,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-10 05:49:51,671 INFO L87 Difference]: Start difference. First operand 79 states and 111 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:49:53,267 INFO L93 Difference]: Finished difference Result 251 states and 346 transitions. [2024-11-10 05:49:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:49:53,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-10 05:49:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:49:53,270 INFO L225 Difference]: With dead ends: 251 [2024-11-10 05:49:53,270 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 05:49:53,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-10 05:49:53,272 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 138 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 05:49:53,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 187 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 05:49:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 05:49:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2024-11-10 05:49:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.2053571428571428) internal successors, (135), 114 states have internal predecessors, (135), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 05:49:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 231 transitions. [2024-11-10 05:49:53,295 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 231 transitions. Word has length 155 [2024-11-10 05:49:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:49:53,296 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 231 transitions. [2024-11-10 05:49:53,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 05:49:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 231 transitions. [2024-11-10 05:49:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 05:49:53,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:49:53,300 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:49:53,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 05:49:53,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-10 05:49:53,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 05:49:53,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:49:53,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:49:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1080020733, now seen corresponding path program 1 times [2024-11-10 05:49:53,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:49:53,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620224489] [2024-11-10 05:49:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:49:53,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:49:53,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:49:53,706 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:49:53,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 05:49:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:49:54,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 05:49:54,551 INFO L278 TraceCheckSpWp]: Computing forward predicates...