./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_operatoramount_amount50_file-51.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 bd2a5c30cd17dfb2cfdc5a318197ef853338672008d794caec406e2d55e8ee3a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:10:13,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:10:13,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:10:13,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:10:13,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:10:13,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:10:13,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:10:13,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:10:13,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:10:13,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:10:13,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:10:13,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:10:13,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:10:13,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:10:13,170 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:10:13,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:10:13,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:10:13,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:10:13,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:10:13,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:10:13,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:10:13,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:10:13,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:10:13,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:10:13,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:10:13,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:10:13,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:10:13,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:10:13,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:10:13,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:10:13,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:10:13,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:10:13,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:10:13,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:10:13,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:10:13,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:10:13,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:10:13,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:10:13,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:10:13,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:10:13,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:10:13,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:10:13,183 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 -> bd2a5c30cd17dfb2cfdc5a318197ef853338672008d794caec406e2d55e8ee3a [2024-11-09 01:10:13,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:10:13,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:10:13,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:10:13,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:10:13,498 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:10:13,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-51.i [2024-11-09 01:10:14,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:10:15,194 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:10:15,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-51.i [2024-11-09 01:10:15,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0915ba348/f1b30cf9075545cfba90f037605dc59a/FLAG446bfa288 [2024-11-09 01:10:15,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0915ba348/f1b30cf9075545cfba90f037605dc59a [2024-11-09 01:10:15,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:10:15,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:10:15,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:10:15,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:10:15,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:10:15,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e22e933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15, skipping insertion in model container [2024-11-09 01:10:15,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:10:15,431 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_operatoramount_amount50_file-51.i[915,928] [2024-11-09 01:10:15,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:10:15,513 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:10:15,528 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_operatoramount_amount50_file-51.i[915,928] [2024-11-09 01:10:15,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:10:15,575 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:10:15,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15 WrapperNode [2024-11-09 01:10:15,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:10:15,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:10:15,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:10:15,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:10:15,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,634 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-11-09 01:10:15,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:10:15,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:10:15,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:10:15,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:10:15,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,669 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-09 01:10:15,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:10:15,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:10:15,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:10:15,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:10:15,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (1/1) ... [2024-11-09 01:10:15,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:10:15,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:10:15,740 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-09 01:10:15,747 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-09 01:10:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:10:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:10:15,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:10:15,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:10:15,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:10:15,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:10:15,879 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:10:15,880 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:10:16,188 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 01:10:16,189 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:10:16,206 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:10:16,206 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:10:16,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:16 BoogieIcfgContainer [2024-11-09 01:10:16,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:10:16,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:10:16,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:10:16,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:10:16,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:10:15" (1/3) ... [2024-11-09 01:10:16,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a473a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:16, skipping insertion in model container [2024-11-09 01:10:16,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:15" (2/3) ... [2024-11-09 01:10:16,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a473a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:16, skipping insertion in model container [2024-11-09 01:10:16,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:16" (3/3) ... [2024-11-09 01:10:16,216 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-51.i [2024-11-09 01:10:16,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:10:16,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:10:16,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:10:16,307 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;@46b3ee94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:10:16,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:10:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:10:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:10:16,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:16,324 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:16,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:16,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1740960990, now seen corresponding path program 1 times [2024-11-09 01:10:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:16,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647026165] [2024-11-09 01:10:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:10:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:10:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:10:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:10:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:10:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:10:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:10:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:10:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:10:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:10:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:10:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:10:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:10:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:10:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:10:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:10:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:10:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:10:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:10:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:10:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:10:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:16,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:10:16,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647026165] [2024-11-09 01:10:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647026165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:16,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:16,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:10:16,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518382765] [2024-11-09 01:10:16,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:16,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:10:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:10:16,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:10:16,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:10:16,836 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:16,871 INFO L93 Difference]: Finished difference Result 127 states and 219 transitions. [2024-11-09 01:10:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:10:16,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2024-11-09 01:10:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:16,919 INFO L225 Difference]: With dead ends: 127 [2024-11-09 01:10:16,921 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 01:10:16,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-09 01:10:16,929 INFO L432 NwaCegarLoop]: 95 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, 95 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-09 01:10:16,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:10:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 01:10:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-09 01:10:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:10:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-09 01:10:16,986 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2024-11-09 01:10:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:16,987 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-09 01:10:16,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-09 01:10:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:10:16,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:16,992 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:16,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:10:16,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1440285028, now seen corresponding path program 1 times [2024-11-09 01:10:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62724314] [2024-11-09 01:10:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:10:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:10:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:10:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:10:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:10:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:10:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:10:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:10:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:10:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:10:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:10:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:10:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:10:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:10:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:10:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:10:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:10:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:10:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:10:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:10:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:10:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:10:17,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62724314] [2024-11-09 01:10:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62724314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:17,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:17,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:10:17,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691070366] [2024-11-09 01:10:17,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:17,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:10:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:10:17,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:10:17,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:10:17,715 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:17,927 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2024-11-09 01:10:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:10:17,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-11-09 01:10:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:17,934 INFO L225 Difference]: With dead ends: 184 [2024-11-09 01:10:17,934 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 01:10:17,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-09 01:10:17,938 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 71 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:17,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 261 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:10:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 01:10:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2024-11-09 01:10:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:10:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2024-11-09 01:10:18,006 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2024-11-09 01:10:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:18,007 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2024-11-09 01:10:18,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2024-11-09 01:10:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:10:18,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:18,011 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:18,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:10:18,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:18,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash -810717471, now seen corresponding path program 1 times [2024-11-09 01:10:18,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:18,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351152990] [2024-11-09 01:10:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:10:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:10:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:10:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:10:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:10:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:10:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:10:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:10:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:10:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:10:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:10:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:10:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:10:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:10:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:10:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:10:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:10:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:10:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:10:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:10:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:10:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:18,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:10:18,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351152990] [2024-11-09 01:10:18,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351152990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:18,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:18,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:10:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22905071] [2024-11-09 01:10:18,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:18,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:10:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:10:18,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:10:18,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:10:18,497 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:18,782 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2024-11-09 01:10:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:10:18,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-11-09 01:10:18,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:18,786 INFO L225 Difference]: With dead ends: 230 [2024-11-09 01:10:18,787 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 01:10:18,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:10:18,793 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:18,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 318 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:10:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 01:10:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2024-11-09 01:10:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-09 01:10:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2024-11-09 01:10:18,840 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 136 [2024-11-09 01:10:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:18,843 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2024-11-09 01:10:18,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2024-11-09 01:10:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:10:18,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:18,845 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:18,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:10:18,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:18,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1205819797, now seen corresponding path program 1 times [2024-11-09 01:10:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802999959] [2024-11-09 01:10:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:10:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:10:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:10:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:10:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:10:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:10:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:10:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:10:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:10:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:10:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:10:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:10:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:10:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:10:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:10:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:10:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:10:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:10:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:10:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:10:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:10:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:19,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:10:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802999959] [2024-11-09 01:10:19,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802999959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:19,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:19,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:10:19,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637215866] [2024-11-09 01:10:19,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:19,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:10:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:10:19,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:10:19,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:10:19,212 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:19,377 INFO L93 Difference]: Finished difference Result 397 states and 609 transitions. [2024-11-09 01:10:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:10:19,378 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), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 137 [2024-11-09 01:10:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:19,381 INFO L225 Difference]: With dead ends: 397 [2024-11-09 01:10:19,382 INFO L226 Difference]: Without dead ends: 279 [2024-11-09 01:10:19,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-09 01:10:19,385 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 77 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:19,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 244 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:10:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-09 01:10:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2024-11-09 01:10:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 166 states have internal predecessors, (214), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-09 01:10:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 424 transitions. [2024-11-09 01:10:19,449 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 424 transitions. Word has length 137 [2024-11-09 01:10:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:19,451 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 424 transitions. [2024-11-09 01:10:19,451 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), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 424 transitions. [2024-11-09 01:10:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:10:19,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:19,453 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:19,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:10:19,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:19,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash 812792787, now seen corresponding path program 1 times [2024-11-09 01:10:19,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:19,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138938383] [2024-11-09 01:10:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:10:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:10:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:10:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:10:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:10:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:10:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:10:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:10:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:10:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:10:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:10:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:10:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:10:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:10:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:10:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:10:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:10:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:10:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:10:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:10:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:10:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:19,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:10:19,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138938383] [2024-11-09 01:10:19,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138938383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:19,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:19,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:10:19,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082061141] [2024-11-09 01:10:19,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:19,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:10:19,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:10:19,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:10:19,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:10:19,666 INFO L87 Difference]: Start difference. First operand 277 states and 424 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:19,717 INFO L93 Difference]: Finished difference Result 521 states and 802 transitions. [2024-11-09 01:10:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:10:19,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-11-09 01:10:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:19,720 INFO L225 Difference]: With dead ends: 521 [2024-11-09 01:10:19,720 INFO L226 Difference]: Without dead ends: 287 [2024-11-09 01:10:19,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:10:19,722 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:19,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 193 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:10:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-09 01:10:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2024-11-09 01:10:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2650602409638554) internal successors, (210), 166 states have internal predecessors, (210), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-09 01:10:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2024-11-09 01:10:19,778 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 137 [2024-11-09 01:10:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:19,779 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2024-11-09 01:10:19,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2024-11-09 01:10:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:10:19,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:19,782 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:19,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:10:19,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:19,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash 463284182, now seen corresponding path program 1 times [2024-11-09 01:10:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771527172] [2024-11-09 01:10:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:10:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:10:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:10:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:10:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:10:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:10:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:10:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:10:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:10:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:10:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:10:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:10:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:10:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:10:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:10:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:10:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:10:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:10:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:10:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:10:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:10:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 01:10:20,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:10:20,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771527172] [2024-11-09 01:10:20,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771527172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:10:20,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523694824] [2024-11-09 01:10:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:20,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:10:20,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:10:20,121 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-09 01:10:20,122 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-09 01:10:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:20,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:10:20,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-09 01:10:20,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:10:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 01:10:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523694824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:10:20,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:10:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-09 01:10:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64803541] [2024-11-09 01:10:20,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:10:20,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:10:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:10:20,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:10:20,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:10:20,708 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-11-09 01:10:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:20,928 INFO L93 Difference]: Finished difference Result 425 states and 625 transitions. [2024-11-09 01:10:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:10:20,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 138 [2024-11-09 01:10:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:20,932 INFO L225 Difference]: With dead ends: 425 [2024-11-09 01:10:20,932 INFO L226 Difference]: Without dead ends: 307 [2024-11-09 01:10:20,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:10:20,933 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 141 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:20,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 149 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:10:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-09 01:10:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 173. [2024-11-09 01:10:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-09 01:10:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-11-09 01:10:20,963 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 138 [2024-11-09 01:10:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:20,964 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-11-09 01:10:20,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-11-09 01:10:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-11-09 01:10:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:10:20,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:20,967 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:20,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:10:21,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 01:10:21,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:21,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash 70257172, now seen corresponding path program 1 times [2024-11-09 01:10:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23660594] [2024-11-09 01:10:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:10:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:10:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:10:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:10:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:10:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:10:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:10:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:10:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:10:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:10:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:10:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:10:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:10:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:10:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:10:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:10:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 01:10:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:10:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 01:10:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 01:10:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:10:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 01:10:21,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:10:21,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23660594] [2024-11-09 01:10:21,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23660594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:10:21,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898878894] [2024-11-09 01:10:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:21,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:10:21,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:10:21,545 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-09 01:10:21,547 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-09 01:10:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:21,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:10:21,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-09 01:10:21,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:10:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 01:10:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898878894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:10:22,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:10:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-09 01:10:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094196510] [2024-11-09 01:10:22,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:10:22,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:10:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:10:22,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:10:22,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:10:22,125 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 01:10:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:22,888 INFO L93 Difference]: Finished difference Result 435 states and 605 transitions. [2024-11-09 01:10:22,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 01:10:22,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 138 [2024-11-09 01:10:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:22,892 INFO L225 Difference]: With dead ends: 435 [2024-11-09 01:10:22,892 INFO L226 Difference]: Without dead ends: 371 [2024-11-09 01:10:22,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 314 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2024-11-09 01:10:22,894 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 202 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:10:22,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 424 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:10:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-09 01:10:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 271. [2024-11-09 01:10:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 160 states have (on average 1.14375) internal successors, (183), 162 states have internal predecessors, (183), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-09 01:10:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 377 transitions. [2024-11-09 01:10:22,983 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 377 transitions. Word has length 138 [2024-11-09 01:10:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:22,984 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 377 transitions. [2024-11-09 01:10:22,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 01:10:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 377 transitions. [2024-11-09 01:10:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 01:10:22,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:22,986 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:23,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:10:23,186 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,SelfDestructingSolverStorable6 [2024-11-09 01:10:23,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:23,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2061646100, now seen corresponding path program 1 times [2024-11-09 01:10:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:10:23,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065628329] [2024-11-09 01:10:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:10:23,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:10:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:10:23,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:10:23,352 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:10:23,353 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:10:23,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:10:23,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:10:23,461 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:10:23,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:10:23 BoogieIcfgContainer [2024-11-09 01:10:23,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:10:23,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:10:23,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:10:23,466 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:10:23,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:16" (3/4) ... [2024-11-09 01:10:23,468 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:10:23,469 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:10:23,470 INFO L158 Benchmark]: Toolchain (without parser) took 8249.29ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 131.0MB in the beginning and 189.0MB in the end (delta: -58.0MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-11-09 01:10:23,470 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 144.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:10:23,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.51ms. Allocated memory is still 176.2MB. Free memory was 131.0MB in the beginning and 114.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:10:23,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.15ms. Allocated memory is still 176.2MB. Free memory was 114.3MB in the beginning and 111.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:10:23,471 INFO L158 Benchmark]: Boogie Preprocessor took 61.85ms. Allocated memory is still 176.2MB. Free memory was 111.5MB in the beginning and 108.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:10:23,471 INFO L158 Benchmark]: RCFGBuilder took 508.31ms. Allocated memory is still 176.2MB. Free memory was 108.0MB in the beginning and 88.4MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 01:10:23,472 INFO L158 Benchmark]: TraceAbstraction took 7255.74ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 87.7MB in the beginning and 190.1MB in the end (delta: -102.3MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-09 01:10:23,473 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 308.3MB. Free memory was 190.1MB in the beginning and 189.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:10:23,475 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 144.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.51ms. Allocated memory is still 176.2MB. Free memory was 131.0MB in the beginning and 114.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.15ms. Allocated memory is still 176.2MB. Free memory was 114.3MB in the beginning and 111.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.85ms. Allocated memory is still 176.2MB. Free memory was 111.5MB in the beginning and 108.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 508.31ms. Allocated memory is still 176.2MB. Free memory was 108.0MB in the beginning and 88.4MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7255.74ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 87.7MB in the beginning and 190.1MB in the end (delta: -102.3MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 308.3MB. Free memory was 190.1MB in the beginning and 189.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L135] last_1_var_1_1 = var_1_1 [L136] last_1_var_1_12 = var_1_12 [L137] last_1_var_1_17 = var_1_17 [L138] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L148] RET updateLastVariables() [L149] CALL updateVariables() [L100] var_1_4 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L108] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L110] var_1_10 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L111] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L112] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L112] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L113] var_1_11 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L115] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L115] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L117] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L119] var_1_15 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L120] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L121] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L121] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L124] var_1_22 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L125] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L126] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L126] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L127] var_1_23 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L129] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L129] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L130] var_1_24 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L131] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L132] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L132] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L149] RET updateVariables() [L150] CALL step() [L47] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L48] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L49] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L50] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L57] unsigned long int stepLocal_1 = last_1_var_1_12; [L58] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L59] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L60] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L61] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L68] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L71] COND TRUE ! (var_1_17 > var_1_5) [L72] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L76] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L77] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L88] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L90] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=-256, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L91] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L94] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 617 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 590 mSDsluCounter, 1684 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1030 mSDsCounter, 397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 713 IncrementalHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 397 mSolverCounterUnsat, 654 mSDtfsCounter, 713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 920 GetRequests, 873 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=4, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 276 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1497 ConstructedInterpolants, 0 QuantifiedInterpolants, 3143 SizeOfPredicates, 5 NumberOfNonLiveVariables, 648 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 9114/9240 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-09 01:10:23,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-51.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 bd2a5c30cd17dfb2cfdc5a318197ef853338672008d794caec406e2d55e8ee3a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:10:25,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:10:25,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:10:25,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:10:25,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:10:25,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:10:25,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:10:25,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:10:25,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:10:25,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:10:25,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:10:25,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:10:25,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:10:25,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:10:25,996 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:10:25,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:10:25,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:10:25,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:10:25,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:10:26,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:10:26,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:10:26,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:10:26,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:10:26,002 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:10:26,003 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:10:26,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:10:26,003 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:10:26,004 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:10:26,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:10:26,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:10:26,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:10:26,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:10:26,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:10:26,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:10:26,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:10:26,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:10:26,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:10:26,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:10:26,009 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:10:26,009 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:10:26,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:10:26,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:10:26,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:10:26,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:10:26,010 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 -> bd2a5c30cd17dfb2cfdc5a318197ef853338672008d794caec406e2d55e8ee3a [2024-11-09 01:10:26,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:10:26,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:10:26,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:10:26,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:10:26,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:10:26,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-51.i [2024-11-09 01:10:27,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:10:28,191 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:10:28,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-51.i [2024-11-09 01:10:28,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22b542965/c531f03dfe5d4e37b2f48ff73b38a4df/FLAGd61d3cf98 [2024-11-09 01:10:28,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22b542965/c531f03dfe5d4e37b2f48ff73b38a4df [2024-11-09 01:10:28,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:10:28,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:10:28,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:10:28,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:10:28,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:10:28,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dabf232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28, skipping insertion in model container [2024-11-09 01:10:28,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:10:28,475 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_operatoramount_amount50_file-51.i[915,928] [2024-11-09 01:10:28,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:10:28,563 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:10:28,578 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_operatoramount_amount50_file-51.i[915,928] [2024-11-09 01:10:28,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:10:28,641 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:10:28,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28 WrapperNode [2024-11-09 01:10:28,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:10:28,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:10:28,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:10:28,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:10:28,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,701 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-09 01:10:28,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:10:28,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:10:28,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:10:28,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:10:28,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,745 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-09 01:10:28,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:10:28,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:10:28,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:10:28,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:10:28,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (1/1) ... [2024-11-09 01:10:28,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:10:28,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:10:28,820 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-09 01:10:28,823 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-09 01:10:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:10:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:10:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:10:28,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:10:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:10:28,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:10:28,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:10:28,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:10:41,711 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 01:10:41,711 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:10:41,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:10:41,726 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:10:41,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:41 BoogieIcfgContainer [2024-11-09 01:10:41,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:10:41,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:10:41,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:10:41,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:10:41,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:10:28" (1/3) ... [2024-11-09 01:10:41,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62460933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:41, skipping insertion in model container [2024-11-09 01:10:41,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:10:28" (2/3) ... [2024-11-09 01:10:41,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62460933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:10:41, skipping insertion in model container [2024-11-09 01:10:41,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:10:41" (3/3) ... [2024-11-09 01:10:41,734 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-51.i [2024-11-09 01:10:41,749 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:10:41,749 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:10:41,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:10:41,813 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;@5fcf5fa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:10:41,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:10:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:10:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:10:41,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:41,838 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:41,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:41,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:41,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1740960990, now seen corresponding path program 1 times [2024-11-09 01:10:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:10:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441141338] [2024-11-09 01:10:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:41,860 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-09 01:10:41,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:10:41,864 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-09 01:10:41,865 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-09 01:10:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:42,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:10:42,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-09 01:10:42,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:10:42,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:10:42,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441141338] [2024-11-09 01:10:42,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441141338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:42,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:42,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:10:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265659711] [2024-11-09 01:10:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:42,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:10:42,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:10:42,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:10:42,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:10:42,741 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:10:42,772 INFO L93 Difference]: Finished difference Result 127 states and 219 transitions. [2024-11-09 01:10:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:10:42,774 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2024-11-09 01:10:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:10:42,780 INFO L225 Difference]: With dead ends: 127 [2024-11-09 01:10:42,781 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 01:10:42,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-09 01:10:42,787 INFO L432 NwaCegarLoop]: 95 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, 95 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-09 01:10:42,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:10:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 01:10:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-09 01:10:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:10:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-09 01:10:42,828 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2024-11-09 01:10:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:10:42,832 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-09 01:10:42,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:10:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-09 01:10:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:10:42,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:10:42,836 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:10:42,856 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-09 01:10:43,037 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-09 01:10:43,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:10:43,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:10:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1440285028, now seen corresponding path program 1 times [2024-11-09 01:10:43,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:10:43,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38994464] [2024-11-09 01:10:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:10:43,040 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-09 01:10:43,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:10:43,043 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-09 01:10:43,046 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-09 01:10:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:43,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:10:43,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:10:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:10:46,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:10:46,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:10:46,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38994464] [2024-11-09 01:10:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38994464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:10:46,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:10:46,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:10:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438228950] [2024-11-09 01:10:46,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:10:46,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:10:46,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:10:46,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:10:46,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:10:46,524 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:10:51,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:55,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:10:59,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:03,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:08,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:12,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:11:12,049 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2024-11-09 01:11:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:11:12,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-11-09 01:11:12,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:11:12,133 INFO L225 Difference]: With dead ends: 184 [2024-11-09 01:11:12,133 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 01:11:12,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:11:12,136 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 43 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:11:12,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 25.4s Time] [2024-11-09 01:11:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 01:11:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2024-11-09 01:11:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:11:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2024-11-09 01:11:12,163 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2024-11-09 01:11:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:11:12,167 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2024-11-09 01:11:12,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:11:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2024-11-09 01:11:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:11:12,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:11:12,174 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:11:12,195 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-09 01:11:12,374 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-09 01:11:12,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:11:12,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:11:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash -810717471, now seen corresponding path program 1 times [2024-11-09 01:11:12,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:11:12,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73655467] [2024-11-09 01:11:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:11:12,377 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-09 01:11:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:11:12,381 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-09 01:11:12,382 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-09 01:11:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:11:13,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:11:13,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:11:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:11:16,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:11:16,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:11:16,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73655467] [2024-11-09 01:11:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73655467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:11:16,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:11:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:11:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827597037] [2024-11-09 01:11:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:11:16,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:11:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:11:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:11:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:11:16,010 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:11:21,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:25,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:28,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:32,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:36,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:40,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:44,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:11:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:11:44,528 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2024-11-09 01:11:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:11:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-11-09 01:11:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:11:44,627 INFO L225 Difference]: With dead ends: 230 [2024-11-09 01:11:44,627 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 01:11:44,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:11:44,629 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 78 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 43 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:11:44,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 318 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 28.3s Time] [2024-11-09 01:11:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 01:11:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2024-11-09 01:11:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-09 01:11:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2024-11-09 01:11:44,701 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 136 [2024-11-09 01:11:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:11:44,701 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2024-11-09 01:11:44,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:11:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2024-11-09 01:11:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:11:44,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:11:44,706 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:11:44,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 01:11:44,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:11:44,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:11:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:11:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1205819797, now seen corresponding path program 1 times [2024-11-09 01:11:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:11:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789095342] [2024-11-09 01:11:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:11:44,908 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-09 01:11:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:11:44,913 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:11:44,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:11:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:11:45,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:11:45,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:11:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:11:45,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:11:45,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:11:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789095342] [2024-11-09 01:11:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789095342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:11:45,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:11:45,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:11:45,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921003583] [2024-11-09 01:11:45,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:11:45,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:11:45,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:11:45,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:11:45,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:11:45,775 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)