./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.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_loopvsstraightlinecode_25-while_file-21.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 7001a99b958cb5a783d624aa4b4b483c2055b6507029df9ffd20f7aa9d768319 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:49:51,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:49:51,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:49:51,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:49:51,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:49:51,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:49:51,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:49:51,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:49:51,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:49:51,582 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:49:51,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:49:51,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:49:51,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:49:51,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:49:51,586 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:49:51,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:49:51,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:49:51,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:49:51,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:49:51,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:49:51,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:49:51,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:49:51,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:49:51,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:49:51,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:49:51,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:49:51,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:49:51,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:49:51,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:49:51,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:49:51,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:49:51,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:49:51,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:49:51,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:49:51,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:49:51,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:49:51,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:49:51,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:49:51,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:49:51,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:49:51,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:49:51,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:49:51,600 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 -> 7001a99b958cb5a783d624aa4b4b483c2055b6507029df9ffd20f7aa9d768319 [2024-11-08 23:49:51,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:49:51,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:49:51,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:49:51,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:49:51,931 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:49:51,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-08 23:49:53,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:49:53,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:49:53,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-08 23:49:53,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c835476/c2c8acb50fc34afc824e74dcf1251945/FLAGd13759e25 [2024-11-08 23:49:53,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c835476/c2c8acb50fc34afc824e74dcf1251945 [2024-11-08 23:49:53,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:49:53,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:49:53,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:49:53,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:49:53,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:49:53,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:49:53" (1/1) ... [2024-11-08 23:49:53,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574dc1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:53, skipping insertion in model container [2024-11-08 23:49:53,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:49:53" (1/1) ... [2024-11-08 23:49:53,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:49:54,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i[915,928] [2024-11-08 23:49:54,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:49:54,211 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:49:54,222 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i[915,928] [2024-11-08 23:49:54,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:49:54,255 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:49:54,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54 WrapperNode [2024-11-08 23:49:54,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:49:54,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:49:54,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:49:54,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:49:54,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,295 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2024-11-08 23:49:54,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:49:54,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:49:54,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:49:54,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:49:54,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,322 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-08 23:49:54,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:49:54,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:49:54,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:49:54,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:49:54,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (1/1) ... [2024-11-08 23:49:54,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:49:54,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:49:54,387 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-08 23:49:54,392 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-08 23:49:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:49:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:49:54,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:49:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:49:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:49:54,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:49:54,515 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:49:54,517 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:49:54,795 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:49:54,796 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:49:54,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:49:54,813 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:49:54,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:49:54 BoogieIcfgContainer [2024-11-08 23:49:54,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:49:54,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:49:54,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:49:54,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:49:54,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:49:53" (1/3) ... [2024-11-08 23:49:54,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6256024c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:49:54, skipping insertion in model container [2024-11-08 23:49:54,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:54" (2/3) ... [2024-11-08 23:49:54,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6256024c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:49:54, skipping insertion in model container [2024-11-08 23:49:54,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:49:54" (3/3) ... [2024-11-08 23:49:54,826 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-08 23:49:54,842 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:49:54,843 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:49:54,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:49:54,909 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;@ad46ab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:49:54,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:49:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 23:49:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:49:54,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:49:54,922 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:49:54,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:49:54,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:49:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1174544175, now seen corresponding path program 1 times [2024-11-08 23:49:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:49:54,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632816320] [2024-11-08 23:49:54,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:49:54,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:49:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:49:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:49:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:49:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:49:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:49:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:49:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:49:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:49:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:49:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:49:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632816320] [2024-11-08 23:49:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632816320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:49:55,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:49:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:49:55,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757514017] [2024-11-08 23:49:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:49:55,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:49:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:49:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:49:55,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:49:55,270 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 23:49:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:49:55,296 INFO L93 Difference]: Finished difference Result 75 states and 119 transitions. [2024-11-08 23:49:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:49:55,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2024-11-08 23:49:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:49:55,308 INFO L225 Difference]: With dead ends: 75 [2024-11-08 23:49:55,308 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 23:49:55,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-08 23:49:55,317 INFO L432 NwaCegarLoop]: 51 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, 51 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-08 23:49:55,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:49:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 23:49:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-08 23:49:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 23:49:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-11-08 23:49:55,359 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 64 [2024-11-08 23:49:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:49:55,360 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-08 23:49:55,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 23:49:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-11-08 23:49:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:49:55,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:49:55,365 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:49:55,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:49:55,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:49:55,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:49:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash -562669323, now seen corresponding path program 1 times [2024-11-08 23:49:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:49:55,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306165914] [2024-11-08 23:49:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:49:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:49:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:49:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:49:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:49:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:49:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:49:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:49:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:49:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:49:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:49:55,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:49:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306165914] [2024-11-08 23:49:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306165914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:49:55,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:49:55,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:49:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735076815] [2024-11-08 23:49:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:49:55,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:49:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:49:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:49:55,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:49:55,664 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:49:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:49:55,696 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2024-11-08 23:49:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:49:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-08 23:49:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:49:55,700 INFO L225 Difference]: With dead ends: 71 [2024-11-08 23:49:55,701 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 23:49:55,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-08 23:49:55,704 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:49:55,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:49:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 23:49:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-08 23:49:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 23:49:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-08 23:49:55,718 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 64 [2024-11-08 23:49:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:49:55,721 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-08 23:49:55,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:49:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-08 23:49:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:49:55,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:49:55,725 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:49:55,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:49:55,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:49:55,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:49:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash -505411021, now seen corresponding path program 1 times [2024-11-08 23:49:55,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:49:55,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025232428] [2024-11-08 23:49:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:49:55,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:49:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:49:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:49:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:49:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:49:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:49:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:49:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:49:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:49:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:49:57,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:49:57,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025232428] [2024-11-08 23:49:57,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025232428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:49:57,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:49:57,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:49:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515911265] [2024-11-08 23:49:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:49:57,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:49:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:49:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:49:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:49:57,286 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:49:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:49:58,027 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2024-11-08 23:49:58,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:49:58,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-08 23:49:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:49:58,029 INFO L225 Difference]: With dead ends: 77 [2024-11-08 23:49:58,030 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 23:49:58,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:49:58,031 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 40 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:49:58,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 315 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:49:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 23:49:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-11-08 23:49:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:49:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2024-11-08 23:49:58,052 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 64 [2024-11-08 23:49:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:49:58,052 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2024-11-08 23:49:58,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:49:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-11-08 23:49:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 23:49:58,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:49:58,056 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:49:58,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:49:58,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:49:58,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:49:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1278414269, now seen corresponding path program 1 times [2024-11-08 23:49:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:49:58,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949677077] [2024-11-08 23:49:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:49:58,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:49:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:49:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:49:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:49:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:49:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:49:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:49:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:49:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:49:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:49:59,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:49:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949677077] [2024-11-08 23:49:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949677077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:49:59,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:49:59,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:49:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258390472] [2024-11-08 23:49:59,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:49:59,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:49:59,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:49:59,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:49:59,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:49:59,238 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:49:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:49:59,874 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2024-11-08 23:49:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:49:59,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2024-11-08 23:49:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:49:59,877 INFO L225 Difference]: With dead ends: 88 [2024-11-08 23:49:59,877 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 23:49:59,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:49:59,878 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:49:59,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 297 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:49:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 23:49:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2024-11-08 23:49:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:49:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2024-11-08 23:49:59,902 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 65 [2024-11-08 23:49:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:49:59,902 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-11-08 23:49:59,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:49:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2024-11-08 23:49:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 23:49:59,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:49:59,904 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:49:59,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:49:59,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:49:59,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:49:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash 434558742, now seen corresponding path program 1 times [2024-11-08 23:49:59,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:49:59,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813894884] [2024-11-08 23:49:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:49:59,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:49:59,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240287263] [2024-11-08 23:49:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:49:59,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:49:59,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:49:59,958 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-08 23:49:59,960 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-08 23:50:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:50:00,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:50:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:50:00,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:50:00,107 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:50:00,109 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:50:00,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:50:00,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:50:00,322 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 23:50:00,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:50:00,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:50:00 BoogieIcfgContainer [2024-11-08 23:50:00,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:50:00,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:50:00,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:50:00,395 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:50:00,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:49:54" (3/4) ... [2024-11-08 23:50:00,398 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:50:00,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:50:00,400 INFO L158 Benchmark]: Toolchain (without parser) took 6434.58ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 128.9MB in the beginning and 113.6MB in the end (delta: 15.3MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2024-11-08 23:50:00,400 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:50:00,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.15ms. Allocated memory is still 159.4MB. Free memory was 128.9MB in the beginning and 114.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:50:00,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.07ms. Allocated memory is still 159.4MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:50:00,401 INFO L158 Benchmark]: Boogie Preprocessor took 39.38ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 109.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:50:00,402 INFO L158 Benchmark]: RCFGBuilder took 477.02ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 123.2MB in the end (delta: -14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:50:00,402 INFO L158 Benchmark]: TraceAbstraction took 5575.00ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 122.0MB in the beginning and 113.6MB in the end (delta: 8.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-08 23:50:00,402 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 207.6MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:50:00,404 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.28ms. Allocated memory is still 159.4MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.15ms. Allocated memory is still 159.4MB. Free memory was 128.9MB in the beginning and 114.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.07ms. Allocated memory is still 159.4MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.38ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 109.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.02ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 123.2MB in the end (delta: -14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5575.00ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 122.0MB in the beginning and 113.6MB in the end (delta: 8.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 207.6MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_7 = 1; [L24] signed char var_1_8 = -32; [L25] signed char var_1_9 = -8; [L26] unsigned char var_1_10 = 2; [L27] double var_1_11 = 15.6; [L28] double var_1_12 = 15.4; [L29] double var_1_13 = 32.2; [L30] unsigned char var_1_14 = 5; [L31] unsigned short int last_1_var_1_1 = 32; [L32] signed char last_1_var_1_8 = -32; [L33] unsigned char last_1_var_1_10 = 2; VAL [isInitial=0, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] CALL updateLastVariables() [L80] last_1_var_1_1 = var_1_1 [L81] last_1_var_1_8 = var_1_8 [L82] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L92] RET updateLastVariables() [L93] CALL updateVariables() [L63] var_1_7 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L64] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L65] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L65] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L66] var_1_9 = __VERIFIER_nondet_char() [L67] CALL assume_abort_if_not(var_1_9 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L67] RET assume_abort_if_not(var_1_9 >= -126) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L69] var_1_11 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L70] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L71] var_1_12 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L72] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L73] var_1_13 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L93] RET updateVariables() [L94] CALL step() [L37] signed long int stepLocal_2 = (((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8)); [L38] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L39] COND TRUE ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L40] COND FALSE !(stepLocal_1 && (last_1_var_1_8 >= var_1_9)) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L48] signed long int stepLocal_0 = ((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_0=2, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L49] COND FALSE !(last_1_var_1_10 < stepLocal_0) [L52] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=0, var_1_9=0] [L54] COND FALSE !((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8)) [L59] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L94] RET step() [L95] CALL, EXPR property() [L85-L86] return ((((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8)) ? (var_1_7 ? (var_1_1 == ((unsigned short int) var_1_10)) : 1) : (var_1_1 == ((unsigned short int) var_1_10))) && ((last_1_var_1_10 < (((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10)))) ? (var_1_8 == ((signed char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((signed char) var_1_9)))) && ((((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13) ? ((var_1_7 && (last_1_var_1_8 >= var_1_9)) ? ((last_1_var_1_1 <= ((((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8)))) ? (var_1_10 == ((unsigned char) var_1_14)) : 1) : 1) : (var_1_10 == ((unsigned char) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 756 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 510 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 246 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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-08 23:50:00,430 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_loopvsstraightlinecode_25-while_file-21.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 7001a99b958cb5a783d624aa4b4b483c2055b6507029df9ffd20f7aa9d768319 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:50:02,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:50:02,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:50:02,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:50:02,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:50:02,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:50:02,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:50:02,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:50:02,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:50:02,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:50:02,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:50:02,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:50:02,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:50:02,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:50:02,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:50:02,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:50:02,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:50:02,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:50:02,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:50:02,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:50:02,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:50:02,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:50:02,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:50:02,926 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:50:02,926 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:50:02,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:50:02,927 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:50:02,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:50:02,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:50:02,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:50:02,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:50:02,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:50:02,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:50:02,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:50:02,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:50:02,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:50:02,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:50:02,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:50:02,932 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:50:02,932 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:50:02,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:50:02,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:50:02,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:50:02,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:50:02,934 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 -> 7001a99b958cb5a783d624aa4b4b483c2055b6507029df9ffd20f7aa9d768319 [2024-11-08 23:50:03,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:50:03,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:50:03,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:50:03,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:50:03,300 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:50:03,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-08 23:50:04,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:50:05,049 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:50:05,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-08 23:50:05,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fbf89cd1/c8f17370bd574f2fb2f3c3ae9dda0c79/FLAG3f6bbb5a5 [2024-11-08 23:50:05,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fbf89cd1/c8f17370bd574f2fb2f3c3ae9dda0c79 [2024-11-08 23:50:05,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:50:05,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:50:05,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:50:05,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:50:05,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:50:05,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ef89d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05, skipping insertion in model container [2024-11-08 23:50:05,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:50:05,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i[915,928] [2024-11-08 23:50:05,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:50:05,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:50:05,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i[915,928] [2024-11-08 23:50:05,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:50:05,452 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:50:05,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05 WrapperNode [2024-11-08 23:50:05,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:50:05,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:50:05,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:50:05,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:50:05,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,516 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-08 23:50:05,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:50:05,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:50:05,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:50:05,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:50:05,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,551 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-08 23:50:05,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:50:05,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:50:05,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:50:05,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:50:05,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (1/1) ... [2024-11-08 23:50:05,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:50:05,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:50:05,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:50:05,613 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-08 23:50:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:50:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:50:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:50:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:50:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:50:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:50:05,736 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:50:05,739 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:50:06,035 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:50:06,035 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:50:06,049 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:50:06,050 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:50:06,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:50:06 BoogieIcfgContainer [2024-11-08 23:50:06,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:50:06,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:50:06,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:50:06,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:50:06,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:50:05" (1/3) ... [2024-11-08 23:50:06,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537cef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:50:06, skipping insertion in model container [2024-11-08 23:50:06,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:05" (2/3) ... [2024-11-08 23:50:06,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537cef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:50:06, skipping insertion in model container [2024-11-08 23:50:06,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:50:06" (3/3) ... [2024-11-08 23:50:06,059 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-08 23:50:06,075 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:50:06,075 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:50:06,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:50:06,168 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;@6b6d3549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:50:06,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:50:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 23:50:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:50:06,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:50:06,186 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:06,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:50:06,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:50:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1174544175, now seen corresponding path program 1 times [2024-11-08 23:50:06,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:50:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292110768] [2024-11-08 23:50:06,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:50:06,208 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-08 23:50:06,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:50:06,212 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-08 23:50:06,214 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-08 23:50:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:06,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:50:06,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:50:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:50:06,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:50:06,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:50:06,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292110768] [2024-11-08 23:50:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292110768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:50:06,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:50:06,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:50:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860185294] [2024-11-08 23:50:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:50:06,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:50:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:50:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:50:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:50:06,459 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 23:50:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:50:06,484 INFO L93 Difference]: Finished difference Result 75 states and 119 transitions. [2024-11-08 23:50:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:50:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2024-11-08 23:50:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:50:06,495 INFO L225 Difference]: With dead ends: 75 [2024-11-08 23:50:06,495 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 23:50:06,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 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-08 23:50:06,503 INFO L432 NwaCegarLoop]: 51 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, 51 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-08 23:50:06,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:50:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 23:50:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-08 23:50:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 23:50:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-11-08 23:50:06,551 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 64 [2024-11-08 23:50:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:50:06,551 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-08 23:50:06,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 23:50:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-11-08 23:50:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:50:06,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:50:06,554 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:06,563 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-08 23:50:06,755 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-08 23:50:06,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:50:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:50:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash -562669323, now seen corresponding path program 1 times [2024-11-08 23:50:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:50:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168611290] [2024-11-08 23:50:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:50:06,757 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-08 23:50:06,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:50:06,762 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-08 23:50:06,766 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-08 23:50:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:06,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:50:06,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:50:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:50:07,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:50:07,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:50:07,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168611290] [2024-11-08 23:50:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168611290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:50:07,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:50:07,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:50:07,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972720226] [2024-11-08 23:50:07,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:50:07,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:50:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:50:07,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:50:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:50:07,092 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:50:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:50:07,313 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2024-11-08 23:50:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:50:07,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-08 23:50:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:50:07,318 INFO L225 Difference]: With dead ends: 116 [2024-11-08 23:50:07,318 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 23:50:07,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:50:07,321 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 45 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:50:07,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:50:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 23:50:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2024-11-08 23:50:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:50:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-11-08 23:50:07,350 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 64 [2024-11-08 23:50:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:50:07,350 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-08 23:50:07,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:50:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-11-08 23:50:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:50:07,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:50:07,353 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:07,359 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-08 23:50:07,557 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-08 23:50:07,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:50:07,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:50:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash -505411021, now seen corresponding path program 1 times [2024-11-08 23:50:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:50:07,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141372970] [2024-11-08 23:50:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:50:07,559 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-08 23:50:07,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:50:07,562 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-08 23:50:07,563 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-08 23:50:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:07,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:50:07,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:50:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:50:40,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:50:40,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:50:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141372970] [2024-11-08 23:50:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141372970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:50:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:50:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:50:40,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306908936] [2024-11-08 23:50:40,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:50:40,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:50:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:50:40,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:50:40,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:50:40,753 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:50:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:50:41,101 INFO L93 Difference]: Finished difference Result 124 states and 167 transitions. [2024-11-08 23:50:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:50:41,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-08 23:50:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:50:41,107 INFO L225 Difference]: With dead ends: 124 [2024-11-08 23:50:41,107 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 23:50:41,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:50:41,111 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 64 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:50:41,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 215 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:50:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 23:50:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2024-11-08 23:50:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 23:50:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-11-08 23:50:41,144 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 64 [2024-11-08 23:50:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:50:41,146 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-11-08 23:50:41,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:50:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-11-08 23:50:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 23:50:41,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:50:41,148 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:41,154 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 (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:50:41,349 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-08 23:50:41,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:50:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:50:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1278414269, now seen corresponding path program 1 times [2024-11-08 23:50:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:50:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821928341] [2024-11-08 23:50:41,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:50:41,351 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-08 23:50:41,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:50:41,353 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-08 23:50:41,354 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-08 23:50:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:41,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:50:41,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:50:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 23:50:53,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:50:53,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:50:53,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821928341] [2024-11-08 23:50:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821928341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:50:53,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:50:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:50:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010603229] [2024-11-08 23:50:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:50:53,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:50:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:50:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:50:53,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:50:53,779 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:50:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:50:54,404 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2024-11-08 23:50:54,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:50:54,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2024-11-08 23:50:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:50:54,411 INFO L225 Difference]: With dead ends: 129 [2024-11-08 23:50:54,411 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 23:50:54,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:50:54,416 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 62 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:50:54,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 225 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:50:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 23:50:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2024-11-08 23:50:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 23:50:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-08 23:50:54,445 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 65 [2024-11-08 23:50:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:50:54,446 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-08 23:50:54,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 23:50:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-08 23:50:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 23:50:54,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:50:54,449 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:54,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 23:50:54,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:50:54,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:50:54,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:50:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1276567227, now seen corresponding path program 1 times [2024-11-08 23:50:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:50:54,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096694682] [2024-11-08 23:50:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:50:54,651 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-08 23:50:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:50:54,654 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08 23:50:54,656 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 (6)] Waiting until timeout for monitored process [2024-11-08 23:50:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:54,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:50:54,728 INFO L278 TraceCheckSpWp]: Computing forward predicates...