./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_normal_file-67.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 f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:30:04,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:30:04,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:30:04,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:30:04,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:30:04,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:30:04,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:30:04,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:30:04,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:30:04,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:30:04,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:30:04,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:30:04,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:30:04,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:30:04,123 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:30:04,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:30:04,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:30:04,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:30:04,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:30:04,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:30:04,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:30:04,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:30:04,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:30:04,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:30:04,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:30:04,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:30:04,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:30:04,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:30:04,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:30:04,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:30:04,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:30:04,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:30:04,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:30:04,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:30:04,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:30:04,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:30:04,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:30:04,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:30:04,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:30:04,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:30:04,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:30:04,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:30:04,149 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 -> f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd [2024-11-12 04:30:04,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:30:04,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:30:04,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:30:04,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:30:04,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:30:04,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i [2024-11-12 04:30:05,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:30:06,073 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:30:06,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i [2024-11-12 04:30:06,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce98bbd53/8bbc2d89a56f46e6b69a396224aafc9e/FLAG18b5cdca3 [2024-11-12 04:30:06,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce98bbd53/8bbc2d89a56f46e6b69a396224aafc9e [2024-11-12 04:30:06,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:30:06,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:30:06,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:30:06,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:30:06,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:30:06,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4402e2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06, skipping insertion in model container [2024-11-12 04:30:06,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:30:06,302 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_normal_file-67.i[913,926] [2024-11-12 04:30:06,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:30:06,367 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:30:06,377 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_normal_file-67.i[913,926] [2024-11-12 04:30:06,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:30:06,424 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:30:06,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06 WrapperNode [2024-11-12 04:30:06,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:30:06,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:30:06,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:30:06,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:30:06,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,483 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-12 04:30:06,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:30:06,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:30:06,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:30:06,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:30:06,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,523 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-12 04:30:06,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:30:06,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:30:06,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:30:06,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:30:06,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (1/1) ... [2024-11-12 04:30:06,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:30:06,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:30:06,624 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-12 04:30:06,632 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-12 04:30:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:30:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:30:06,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:30:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:30:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:30:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:30:06,807 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:30:06,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:30:07,233 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-12 04:30:07,233 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:30:07,259 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:30:07,264 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:30:07,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:30:07 BoogieIcfgContainer [2024-11-12 04:30:07,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:30:07,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:30:07,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:30:07,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:30:07,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:30:06" (1/3) ... [2024-11-12 04:30:07,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e3c678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:30:07, skipping insertion in model container [2024-11-12 04:30:07,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:06" (2/3) ... [2024-11-12 04:30:07,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e3c678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:30:07, skipping insertion in model container [2024-11-12 04:30:07,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:30:07" (3/3) ... [2024-11-12 04:30:07,279 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-67.i [2024-11-12 04:30:07,298 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:30:07,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:30:07,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:30:07,419 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;@2e55cb84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:30:07,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:30:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 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-12 04:30:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-12 04:30:07,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:30:07,444 INFO L218 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] [2024-11-12 04:30:07,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:30:07,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:30:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash 278360197, now seen corresponding path program 1 times [2024-11-12 04:30:07,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:30:07,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833815188] [2024-11-12 04:30:07,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:30:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:30:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:30:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:30:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:30:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:30:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:30:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:30:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:30:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:30:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:30:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:30:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:30:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:30:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 04:30:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:30:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 04:30:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:30:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 04:30:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:30:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:30:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:30:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:30:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:30:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,033 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-12 04:30:08,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:30:08,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833815188] [2024-11-12 04:30:08,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833815188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:30:08,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:30:08,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:30:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177571525] [2024-11-12 04:30:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:30:08,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:30:08,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:30:08,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:30:08,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:30:08,073 INFO L87 Difference]: Start difference. First operand has 79 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 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) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-12 04:30:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:30:08,104 INFO L93 Difference]: Finished difference Result 151 states and 256 transitions. [2024-11-12 04:30:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:30:08,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 142 [2024-11-12 04:30:08,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:30:08,115 INFO L225 Difference]: With dead ends: 151 [2024-11-12 04:30:08,115 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 04:30:08,118 INFO L434 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-12 04:30:08,121 INFO L435 NwaCegarLoop]: 113 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, 113 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-12 04:30:08,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:30:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 04:30:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-12 04:30:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 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-12 04:30:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-11-12 04:30:08,192 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 142 [2024-11-12 04:30:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:30:08,192 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-11-12 04:30:08,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-12 04:30:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-11-12 04:30:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-12 04:30:08,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:30:08,198 INFO L218 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] [2024-11-12 04:30:08,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:30:08,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:30:08,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:30:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1150782029, now seen corresponding path program 1 times [2024-11-12 04:30:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:30:08,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585948991] [2024-11-12 04:30:08,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:30:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:30:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:30:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:30:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:30:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:30:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:30:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:30:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:30:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:30:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:30:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:30:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:30:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:30:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 04:30:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:30:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 04:30:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:30:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 04:30:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:30:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:30:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:30:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:30:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:30:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:08,747 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-12 04:30:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:30:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585948991] [2024-11-12 04:30:08,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585948991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:30:08,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:30:08,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:30:08,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183905059] [2024-11-12 04:30:08,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:30:08,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:30:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:30:08,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:30:08,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:30:08,753 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-12 04:30:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:30:08,929 INFO L93 Difference]: Finished difference Result 220 states and 334 transitions. [2024-11-12 04:30:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:30:08,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 142 [2024-11-12 04:30:08,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:30:08,934 INFO L225 Difference]: With dead ends: 220 [2024-11-12 04:30:08,936 INFO L226 Difference]: Without dead ends: 148 [2024-11-12 04:30:08,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:30:08,938 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:30:08,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 312 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:30:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-12 04:30:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2024-11-12 04:30:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:30:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 190 transitions. [2024-11-12 04:30:08,978 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 190 transitions. Word has length 142 [2024-11-12 04:30:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:30:08,979 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 190 transitions. [2024-11-12 04:30:08,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-12 04:30:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 190 transitions. [2024-11-12 04:30:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 04:30:08,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:30:08,981 INFO L218 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] [2024-11-12 04:30:08,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:30:08,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:30:08,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:30:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1463221889, now seen corresponding path program 1 times [2024-11-12 04:30:08,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:30:08,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805564626] [2024-11-12 04:30:08,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:30:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:30:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:30:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:30:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:30:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:30:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:30:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:30:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:30:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:30:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:30:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:30:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:30:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:30:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 04:30:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:30:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 04:30:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:30:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 04:30:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:30:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:30:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:30:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:30:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:30:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-12 04:30:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:30:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805564626] [2024-11-12 04:30:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805564626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:30:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443391315] [2024-11-12 04:30:09,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:30:09,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:30:09,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:30:09,433 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-12 04:30:09,438 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-12 04:30:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:09,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 04:30:09,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:30:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 177 proven. 57 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-11-12 04:30:09,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:30:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-12 04:30:10,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443391315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:30:10,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:30:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 04:30:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836136920] [2024-11-12 04:30:10,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:30:10,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:30:10,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:30:10,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:30:10,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:30:10,075 INFO L87 Difference]: Start difference. First operand 126 states and 190 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-12 04:30:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:30:10,290 INFO L93 Difference]: Finished difference Result 208 states and 306 transitions. [2024-11-12 04:30:10,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 04:30:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 144 [2024-11-12 04:30:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:30:10,295 INFO L225 Difference]: With dead ends: 208 [2024-11-12 04:30:10,295 INFO L226 Difference]: Without dead ends: 136 [2024-11-12 04:30:10,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:30:10,298 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 132 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:30:10,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 196 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:30:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-12 04:30:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2024-11-12 04:30:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:30:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2024-11-12 04:30:10,322 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 144 [2024-11-12 04:30:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:30:10,323 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2024-11-12 04:30:10,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-12 04:30:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2024-11-12 04:30:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 04:30:10,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:30:10,325 INFO L218 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] [2024-11-12 04:30:10,342 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-12 04:30:10,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:30:10,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:30:10,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:30:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash 485534327, now seen corresponding path program 1 times [2024-11-12 04:30:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:30:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050888383] [2024-11-12 04:30:10,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:30:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:30:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:30:10,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2101842362] [2024-11-12 04:30:10,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:30:10,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:30:10,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:30:10,703 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-12 04:30:10,704 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-12 04:30:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:30:10,796 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:30:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:30:10,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:30:10,900 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:30:10,901 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:30:10,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 04:30:11,103 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,SelfDestructingSolverStorable3 [2024-11-12 04:30:11,107 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 04:30:11,179 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:30:11,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:30:11 BoogieIcfgContainer [2024-11-12 04:30:11,182 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:30:11,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:30:11,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:30:11,183 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:30:11,183 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:30:07" (3/4) ... [2024-11-12 04:30:11,185 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:30:11,186 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:30:11,187 INFO L158 Benchmark]: Toolchain (without parser) took 5081.83ms. Allocated memory was 153.1MB in the beginning and 312.5MB in the end (delta: 159.4MB). Free memory was 80.7MB in the beginning and 179.9MB in the end (delta: -99.2MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2024-11-12 04:30:11,187 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 153.1MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:30:11,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.08ms. Allocated memory is still 153.1MB. Free memory was 80.6MB in the beginning and 65.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:30:11,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.66ms. Allocated memory is still 153.1MB. Free memory was 65.0MB in the beginning and 61.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:30:11,188 INFO L158 Benchmark]: Boogie Preprocessor took 99.72ms. Allocated memory was 153.1MB in the beginning and 239.1MB in the end (delta: 86.0MB). Free memory was 61.1MB in the beginning and 206.4MB in the end (delta: -145.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-11-12 04:30:11,188 INFO L158 Benchmark]: RCFGBuilder took 681.35ms. Allocated memory is still 239.1MB. Free memory was 206.3MB in the beginning and 184.6MB in the end (delta: 21.7MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-11-12 04:30:11,188 INFO L158 Benchmark]: TraceAbstraction took 3911.47ms. Allocated memory was 239.1MB in the beginning and 312.5MB in the end (delta: 73.4MB). Free memory was 184.6MB in the beginning and 179.9MB in the end (delta: 4.7MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2024-11-12 04:30:11,189 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 312.5MB. Free memory is still 179.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:30:11,190 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 153.1MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.08ms. Allocated memory is still 153.1MB. Free memory was 80.6MB in the beginning and 65.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.66ms. Allocated memory is still 153.1MB. Free memory was 65.0MB in the beginning and 61.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.72ms. Allocated memory was 153.1MB in the beginning and 239.1MB in the end (delta: 86.0MB). Free memory was 61.1MB in the beginning and 206.4MB in the end (delta: -145.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * RCFGBuilder took 681.35ms. Allocated memory is still 239.1MB. Free memory was 206.3MB in the beginning and 184.6MB in the end (delta: 21.7MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3911.47ms. Allocated memory was 239.1MB in the beginning and 312.5MB in the end (delta: 73.4MB). Free memory was 184.6MB in the beginning and 179.9MB in the end (delta: 4.7MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 312.5MB. Free memory is still 179.9MB. 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 139, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9.75; [L23] unsigned char var_1_3 = 1; [L24] signed long int var_1_4 = 25; [L25] unsigned char var_1_6 = 1; [L26] float var_1_7 = 7.5; [L27] signed long int var_1_8 = -1000; [L28] float var_1_9 = 9.25; [L29] float var_1_10 = 64.5; [L30] float var_1_11 = 16.25; [L31] signed char var_1_12 = 2; [L32] signed char var_1_13 = 8; [L33] signed char var_1_14 = 0; [L34] float var_1_15 = 0.6; [L35] signed char var_1_16 = 32; [L36] unsigned short int var_1_17 = 2; [L37] unsigned short int var_1_19 = 63241; [L38] unsigned short int var_1_20 = 58697; [L39] unsigned short int var_1_21 = 25516; [L40] unsigned long int var_1_22 = 3301682525; [L41] double last_1_var_1_1 = 9.75; [L42] unsigned char last_1_var_1_3 = 1; [L43] float last_1_var_1_7 = 7.5; [L44] signed char last_1_var_1_12 = 2; [L45] float last_1_var_1_15 = 0.6; [L46] unsigned short int last_1_var_1_17 = 2; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=25, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] CALL updateLastVariables() [L131] last_1_var_1_1 = var_1_1 [L132] last_1_var_1_3 = var_1_3 [L133] last_1_var_1_7 = var_1_7 [L134] last_1_var_1_12 = var_1_12 [L135] last_1_var_1_15 = var_1_15 [L136] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=25, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L146] RET updateLastVariables() [L147] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L98] var_1_6 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L99] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L101] var_1_8 = __VERIFIER_nondet_long() [L102] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L102] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L103] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L103] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L104] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L104] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=37/4] [L105] var_1_9 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L106] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L107] var_1_10 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L108] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L109] var_1_11 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L110] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L111] var_1_13 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L112] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L113] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L113] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L114] var_1_14 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L115] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L116] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L116] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L117] var_1_19 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_19 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L118] RET assume_abort_if_not(var_1_19 >= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L119] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L119] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L120] var_1_20 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L121] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L122] CALL assume_abort_if_not(var_1_20 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L122] RET assume_abort_if_not(var_1_20 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L123] var_1_21 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_21 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L124] RET assume_abort_if_not(var_1_21 >= 24575) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L125] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L125] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L126] var_1_22 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L127] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L128] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L128] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L147] RET updateVariables() [L148] CALL step() [L50] EXPR ((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L50] signed long int stepLocal_2 = ((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12; [L51] COND FALSE !(last_1_var_1_7 > (var_1_11 + last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L60] unsigned long int stepLocal_3 = var_1_22 - var_1_20; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L61] COND TRUE \read(last_1_var_1_3) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L62] COND TRUE \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L63] COND TRUE \read(last_1_var_1_3) [L64] var_1_17 = var_1_14 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L78] var_1_3 = (((5 - last_1_var_1_17) <= (last_1_var_1_17 + last_1_var_1_17)) || var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L79] COND TRUE 50 != var_1_16 [L80] var_1_1 = (1.00000000000025E12 - 24.25) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=2, var_1_13=2, var_1_14=2, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131] [L82] var_1_12 = (var_1_13 - var_1_14) [L83] var_1_15 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L84] unsigned char stepLocal_1 = var_1_3; [L85] signed long int stepLocal_0 = (var_1_16 + 100) / var_1_8; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] [L86] COND FALSE !(stepLocal_0 >= var_1_17) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, stepLocal_1=1, stepLocal_2=2, stepLocal_3=2147450880, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR ((((((50 != var_1_16) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - last_1_var_1_17) <= (last_1_var_1_17 + last_1_var_1_17)) || var_1_6)))) && ((((var_1_16 + 100) / var_1_8) >= var_1_17) ? ((var_1_3 || (var_1_17 > (var_1_17 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((last_1_var_1_7 > (var_1_11 + last_1_var_1_15)) ? ((var_1_14 < (((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12)) ? (last_1_var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] [L139-L140] return (((((((50 != var_1_16) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - last_1_var_1_17) <= (last_1_var_1_17 + last_1_var_1_17)) || var_1_6)))) && ((((var_1_16 + 100) / var_1_8) >= var_1_17) ? ((var_1_3 || (var_1_17 > (var_1_17 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((last_1_var_1_7 > (var_1_11 + last_1_var_1_15)) ? ((var_1_14 < (((((var_1_13) > (last_1_var_1_17)) ? (var_1_13) : (last_1_var_1_17))) | last_1_var_1_12)) ? (last_1_var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1)) && (last_1_var_1_3 ? (var_1_6 ? (last_1_var_1_3 ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) (((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))) - ((var_1_21 - 256) - 256))))) : (((var_1_22 - var_1_20) > (var_1_4 / var_1_8)) ? ((last_1_var_1_1 >= var_1_10) ? (var_1_17 == ((unsigned short int) var_1_14)) : 1) : 1)) : (var_1_17 == ((unsigned short int) var_1_21))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_15=3/5, last_1_var_1_17=2, last_1_var_1_1=39/4, last_1_var_1_3=1, last_1_var_1_7=15/2, var_1_12=0, var_1_13=2, var_1_14=2, var_1_15=2, var_1_16=32, var_1_17=2, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_3=1, var_1_4=130, var_1_6=1, var_1_7=15/2, var_1_8=131, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 621 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 320 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 301 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 860 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 711 ConstructedInterpolants, 0 QuantifiedInterpolants, 1579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4449/4620 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-12 04:30:11,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_normal_file-67.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 f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:30:13,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:30:13,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:30:13,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:30:13,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:30:13,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:30:13,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:30:13,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:30:13,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:30:13,432 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:30:13,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:30:13,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:30:13,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:30:13,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:30:13,435 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:30:13,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:30:13,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:30:13,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:30:13,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:30:13,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:30:13,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:30:13,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:30:13,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:30:13,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:30:13,438 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:30:13,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:30:13,438 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:30:13,439 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:30:13,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:30:13,439 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:30:13,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:30:13,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:30:13,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:30:13,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:30:13,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:30:13,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:30:13,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:30:13,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:30:13,441 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:30:13,441 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:30:13,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:30:13,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:30:13,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:30:13,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:30:13,443 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 -> f7bea5741e988234a3cc25ba095c1dd45131a854b9775fd89c7f497f9d6fb0dd [2024-11-12 04:30:13,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:30:13,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:30:13,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:30:13,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:30:13,764 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:30:13,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i [2024-11-12 04:30:15,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:30:15,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:30:15,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-67.i [2024-11-12 04:30:15,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a18a595/d2047817babc463eb521c8686b730684/FLAG40c7c4c3a [2024-11-12 04:30:15,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a18a595/d2047817babc463eb521c8686b730684 [2024-11-12 04:30:15,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:30:15,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:30:15,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:30:15,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:30:15,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:30:15,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5465bec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15, skipping insertion in model container [2024-11-12 04:30:15,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:30:15,696 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_normal_file-67.i[913,926] [2024-11-12 04:30:15,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:30:15,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:30:15,802 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_normal_file-67.i[913,926] [2024-11-12 04:30:15,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:30:15,870 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:30:15,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15 WrapperNode [2024-11-12 04:30:15,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:30:15,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:30:15,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:30:15,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:30:15,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,913 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-11-12 04:30:15,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:30:15,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:30:15,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:30:15,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:30:15,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,955 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-12 04:30:15,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:30:15,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:30:15,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:30:15,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:30:15,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (1/1) ... [2024-11-12 04:30:15,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:30:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:30:16,022 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-12 04:30:16,028 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-12 04:30:16,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:30:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:30:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:30:16,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:30:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:30:16,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:30:16,124 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:30:16,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:30:17,756 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 04:30:17,756 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:30:17,766 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:30:17,767 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:30:17,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:30:17 BoogieIcfgContainer [2024-11-12 04:30:17,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:30:17,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:30:17,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:30:17,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:30:17,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:30:15" (1/3) ... [2024-11-12 04:30:17,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409c2737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:30:17, skipping insertion in model container [2024-11-12 04:30:17,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:30:15" (2/3) ... [2024-11-12 04:30:17,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409c2737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:30:17, skipping insertion in model container [2024-11-12 04:30:17,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:30:17" (3/3) ... [2024-11-12 04:30:17,774 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-67.i [2024-11-12 04:30:17,787 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:30:17,787 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:30:17,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:30:17,857 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;@4b168850, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:30:17,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:30:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 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-12 04:30:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 04:30:17,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:30:17,877 INFO L218 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] [2024-11-12 04:30:17,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:30:17,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:30:17,885 INFO L85 PathProgramCache]: Analyzing trace with hash -241762095, now seen corresponding path program 1 times [2024-11-12 04:30:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:30:17,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871523687] [2024-11-12 04:30:17,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:30:17,902 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-12 04:30:17,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:30:17,905 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-12 04:30:17,906 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-12 04:30:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:18,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 04:30:18,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:30:19,013 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-12 04:30:19,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:30:19,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:30:19,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871523687] [2024-11-12 04:30:19,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871523687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:30:19,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:30:19,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:30:19,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359566655] [2024-11-12 04:30:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:30:19,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:30:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:30:19,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:30:19,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:30:19,040 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 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 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-12 04:30:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:30:20,802 INFO L93 Difference]: Finished difference Result 188 states and 341 transitions. [2024-11-12 04:30:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:30:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 138 [2024-11-12 04:30:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:30:20,835 INFO L225 Difference]: With dead ends: 188 [2024-11-12 04:30:20,835 INFO L226 Difference]: Without dead ends: 124 [2024-11-12 04:30:20,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:30:20,842 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 59 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 04:30:20,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 262 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 04:30:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-12 04:30:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2024-11-12 04:30:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 63 states have internal predecessors, (78), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:30:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 166 transitions. [2024-11-12 04:30:20,933 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 166 transitions. Word has length 138 [2024-11-12 04:30:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:30:20,934 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 166 transitions. [2024-11-12 04:30:20,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-12 04:30:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 166 transitions. [2024-11-12 04:30:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 04:30:20,941 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:30:20,941 INFO L218 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] [2024-11-12 04:30:20,953 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-12 04:30:21,141 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-12 04:30:21,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:30:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:30:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1874507683, now seen corresponding path program 1 times [2024-11-12 04:30:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:30:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168050691] [2024-11-12 04:30:21,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:30:21,145 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-12 04:30:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:30:21,148 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-12 04:30:21,149 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-12 04:30:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:21,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 04:30:21,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:30:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 177 proven. 57 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-11-12 04:30:21,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:30:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-12 04:30:22,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:30:22,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168050691] [2024-11-12 04:30:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168050691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:30:22,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:30:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-12 04:30:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934581606] [2024-11-12 04:30:22,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:30:22,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:30:22,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:30:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:30:22,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:30:22,215 INFO L87 Difference]: Start difference. First operand 110 states and 166 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-12 04:30:23,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:30:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:30:23,766 INFO L93 Difference]: Finished difference Result 180 states and 264 transitions. [2024-11-12 04:30:23,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 04:30:23,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 140 [2024-11-12 04:30:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:30:23,789 INFO L225 Difference]: With dead ends: 180 [2024-11-12 04:30:23,789 INFO L226 Difference]: Without dead ends: 120 [2024-11-12 04:30:23,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:30:23,791 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:30:23,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 145 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 04:30:23,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-12 04:30:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-11-12 04:30:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:30:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-12 04:30:23,816 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 140 [2024-11-12 04:30:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:30:23,819 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-12 04:30:23,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-12 04:30:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-12 04:30:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 04:30:23,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:30:23,823 INFO L218 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] [2024-11-12 04:30:23,842 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-12 04:30:24,023 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-12 04:30:24,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:30:24,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:30:24,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1993851237, now seen corresponding path program 1 times [2024-11-12 04:30:24,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:30:24,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749156572] [2024-11-12 04:30:24,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:30:24,028 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-12 04:30:24,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:30:24,031 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-12 04:30:24,032 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-12 04:30:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:30:24,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 04:30:24,299 INFO L279 TraceCheckSpWp]: Computing forward predicates...