./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/hardware-verification-bv/btor2c-lazyMod.cal57.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:03:24,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:03:24,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-18 17:03:24,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:03:24,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:03:24,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:03:24,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:03:24,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:03:24,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:03:24,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:03:24,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:03:24,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:03:24,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:03:24,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:03:24,911 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:03:24,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:03:24,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:03:24,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 17:03:24,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:03:24,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:03:24,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:03:24,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:03:24,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:03:24,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:03:24,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:03:24,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:03:24,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:03:24,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:03:24,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:03:24,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:03:24,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:03:24,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:03:24,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:03:24,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 17:03:24,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 17:03:24,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:03:24,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:03:24,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:03:24,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:03:24,921 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2024-11-18 17:03:25,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:03:25,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:03:25,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:03:25,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:03:25,196 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:03:25,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-18 17:03:26,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:03:26,938 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:03:26,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-18 17:03:26,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e30e0ac/a8568bee2ae5458e90468d2ec66d161c/FLAG40d954061 [2024-11-18 17:03:26,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e30e0ac/a8568bee2ae5458e90468d2ec66d161c [2024-11-18 17:03:26,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:03:26,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:03:26,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:03:26,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:03:26,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:03:26,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:03:26" (1/1) ... [2024-11-18 17:03:26,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d592a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:26, skipping insertion in model container [2024-11-18 17:03:26,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:03:26" (1/1) ... [2024-11-18 17:03:27,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:03:27,220 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/hardware-verification-bv/btor2c-lazyMod.cal57.c[1245,1258] [2024-11-18 17:03:27,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:03:27,289 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:03:27,299 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/hardware-verification-bv/btor2c-lazyMod.cal57.c[1245,1258] [2024-11-18 17:03:27,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:03:27,352 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:03:27,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27 WrapperNode [2024-11-18 17:03:27,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:03:27,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:03:27,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:03:27,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:03:27,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,424 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 296 [2024-11-18 17:03:27,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:03:27,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:03:27,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:03:27,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:03:27,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,468 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-18 17:03:27,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:03:27,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:03:27,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:03:27,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:03:27,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (1/1) ... [2024-11-18 17:03:27,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:03:27,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:03:27,556 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-18 17:03:27,562 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-18 17:03:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:03:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 17:03:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 17:03:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:03:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:03:27,715 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:03:27,718 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:03:28,221 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-18 17:03:28,222 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:03:28,238 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:03:28,240 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:03:28,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:03:28 BoogieIcfgContainer [2024-11-18 17:03:28,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:03:28,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:03:28,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:03:28,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:03:28,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:03:26" (1/3) ... [2024-11-18 17:03:28,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d7383a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:03:28, skipping insertion in model container [2024-11-18 17:03:28,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:27" (2/3) ... [2024-11-18 17:03:28,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d7383a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:03:28, skipping insertion in model container [2024-11-18 17:03:28,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:03:28" (3/3) ... [2024-11-18 17:03:28,247 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2024-11-18 17:03:28,259 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:03:28,259 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:03:28,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:03:28,317 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;@2a27e42d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:03:28,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:03:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 17:03:28,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:03:28,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 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-18 17:03:28,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:03:28,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:03:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2017394231, now seen corresponding path program 1 times [2024-11-18 17:03:28,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:03:28,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665130468] [2024-11-18 17:03:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:03:28,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:03:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:03:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:03:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:03:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665130468] [2024-11-18 17:03:29,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665130468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:03:29,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:03:29,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:03:29,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686364831] [2024-11-18 17:03:29,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:03:29,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:03:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:03:29,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:03:29,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:03:29,046 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:03:29,099 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2024-11-18 17:03:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:03:29,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-18 17:03:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:03:29,111 INFO L225 Difference]: With dead ends: 113 [2024-11-18 17:03:29,111 INFO L226 Difference]: Without dead ends: 65 [2024-11-18 17:03:29,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:03:29,117 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:03:29,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:03:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-18 17:03:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-18 17:03:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-11-18 17:03:29,152 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 27 [2024-11-18 17:03:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:03:29,152 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-11-18 17:03:29,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-18 17:03:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 17:03:29,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:03:29,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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-18 17:03:29,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 17:03:29,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:03:29,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:03:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1883592983, now seen corresponding path program 1 times [2024-11-18 17:03:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:03:29,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415329492] [2024-11-18 17:03:29,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:03:29,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:03:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:03:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:03:29,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:03:29,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415329492] [2024-11-18 17:03:29,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415329492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:03:29,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:03:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:03:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805736703] [2024-11-18 17:03:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:03:29,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:03:29,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:03:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:03:29,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:03:29,326 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:29,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:03:29,380 INFO L93 Difference]: Finished difference Result 114 states and 163 transitions. [2024-11-18 17:03:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:03:29,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-18 17:03:29,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:03:29,382 INFO L225 Difference]: With dead ends: 114 [2024-11-18 17:03:29,382 INFO L226 Difference]: Without dead ends: 67 [2024-11-18 17:03:29,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:03:29,384 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:03:29,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:03:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-18 17:03:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-18 17:03:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2024-11-18 17:03:29,391 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 28 [2024-11-18 17:03:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:03:29,391 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2024-11-18 17:03:29,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2024-11-18 17:03:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 17:03:29,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:03:29,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-18 17:03:29,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 17:03:29,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:03:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:03:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash 640193872, now seen corresponding path program 1 times [2024-11-18 17:03:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:03:29,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945461163] [2024-11-18 17:03:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:03:29,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:03:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:03:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:03:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:03:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945461163] [2024-11-18 17:03:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945461163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:03:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:03:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 17:03:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168253716] [2024-11-18 17:03:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:03:29,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 17:03:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:03:29,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 17:03:29,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 17:03:29,686 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:03:29,816 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2024-11-18 17:03:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 17:03:29,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-18 17:03:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:03:29,820 INFO L225 Difference]: With dead ends: 153 [2024-11-18 17:03:29,821 INFO L226 Difference]: Without dead ends: 104 [2024-11-18 17:03:29,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-18 17:03:29,822 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 179 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:03:29,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 326 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:03:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-18 17:03:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2024-11-18 17:03:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-18 17:03:29,838 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 29 [2024-11-18 17:03:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:03:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-18 17:03:29,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-18 17:03:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 17:03:29,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:03:29,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-18 17:03:29,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 17:03:29,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:03:29,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:03:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash -719939504, now seen corresponding path program 1 times [2024-11-18 17:03:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:03:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548084063] [2024-11-18 17:03:29,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:03:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:03:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:03:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:03:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:03:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548084063] [2024-11-18 17:03:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548084063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:03:30,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:03:30,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 17:03:30,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147619903] [2024-11-18 17:03:30,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:03:30,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 17:03:30,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:03:30,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 17:03:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 17:03:30,235 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:03:30,378 INFO L93 Difference]: Finished difference Result 155 states and 217 transitions. [2024-11-18 17:03:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 17:03:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-18 17:03:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:03:30,380 INFO L225 Difference]: With dead ends: 155 [2024-11-18 17:03:30,380 INFO L226 Difference]: Without dead ends: 106 [2024-11-18 17:03:30,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-18 17:03:30,382 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 182 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:03:30,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 476 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:03:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-18 17:03:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2024-11-18 17:03:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-11-18 17:03:30,388 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 30 [2024-11-18 17:03:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:03:30,389 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-11-18 17:03:30,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-11-18 17:03:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 17:03:30,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:03:30,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-18 17:03:30,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 17:03:30,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:03:30,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:03:30,393 INFO L85 PathProgramCache]: Analyzing trace with hash -523941715, now seen corresponding path program 1 times [2024-11-18 17:03:30,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:03:30,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766323819] [2024-11-18 17:03:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:03:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:03:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:03:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:03:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:03:30,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766323819] [2024-11-18 17:03:30,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766323819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:03:30,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:03:30,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 17:03:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001133572] [2024-11-18 17:03:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:03:30,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 17:03:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:03:30,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 17:03:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-18 17:03:30,880 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:03:31,066 INFO L93 Difference]: Finished difference Result 155 states and 216 transitions. [2024-11-18 17:03:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 17:03:31,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-18 17:03:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:03:31,069 INFO L225 Difference]: With dead ends: 155 [2024-11-18 17:03:31,070 INFO L226 Difference]: Without dead ends: 106 [2024-11-18 17:03:31,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-18 17:03:31,072 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 177 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:03:31,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 458 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:03:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-18 17:03:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2024-11-18 17:03:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2024-11-18 17:03:31,078 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 31 [2024-11-18 17:03:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:03:31,078 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2024-11-18 17:03:31,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2024-11-18 17:03:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-18 17:03:31,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:03:31,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-18 17:03:31,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 17:03:31,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:03:31,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:03:31,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1792746033, now seen corresponding path program 1 times [2024-11-18 17:03:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:03:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109780473] [2024-11-18 17:03:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:03:31,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:03:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 17:03:31,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 17:03:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 17:03:31,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 17:03:31,171 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 17:03:31,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 17:03:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 17:03:31,176 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-18 17:03:31,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 17:03:31,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:03:31 BoogieIcfgContainer [2024-11-18 17:03:31,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 17:03:31,225 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 17:03:31,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 17:03:31,225 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 17:03:31,226 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:03:28" (3/4) ... [2024-11-18 17:03:31,228 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 17:03:31,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 17:03:31,231 INFO L158 Benchmark]: Toolchain (without parser) took 4257.22ms. Allocated memory was 172.0MB in the beginning and 226.5MB in the end (delta: 54.5MB). Free memory was 103.4MB in the beginning and 88.7MB in the end (delta: 14.6MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2024-11-18 17:03:31,231 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:03:31,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.30ms. Allocated memory is still 172.0MB. Free memory was 103.2MB in the beginning and 138.3MB in the end (delta: -35.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 17:03:31,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.07ms. Allocated memory is still 172.0MB. Free memory was 138.3MB in the beginning and 132.0MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 17:03:31,232 INFO L158 Benchmark]: Boogie Preprocessor took 92.12ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 127.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 17:03:31,232 INFO L158 Benchmark]: RCFGBuilder took 722.12ms. Allocated memory is still 172.0MB. Free memory was 127.0MB in the beginning and 89.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-18 17:03:31,233 INFO L158 Benchmark]: TraceAbstraction took 2981.88ms. Allocated memory was 172.0MB in the beginning and 226.5MB in the end (delta: 54.5MB). Free memory was 88.6MB in the beginning and 89.8MB in the end (delta: -1.2MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2024-11-18 17:03:31,233 INFO L158 Benchmark]: Witness Printer took 5.86ms. Allocated memory is still 226.5MB. Free memory was 89.8MB in the beginning and 88.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:03:31,234 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.30ms. Allocated memory is still 172.0MB. Free memory was 103.2MB in the beginning and 138.3MB in the end (delta: -35.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.07ms. Allocated memory is still 172.0MB. Free memory was 138.3MB in the beginning and 132.0MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.12ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 127.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 722.12ms. Allocated memory is still 172.0MB. Free memory was 127.0MB in the beginning and 89.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2981.88ms. Allocated memory was 172.0MB in the beginning and 226.5MB in the end (delta: 54.5MB). Free memory was 88.6MB in the beginning and 89.8MB in the end (delta: -1.2MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * Witness Printer took 5.86ms. Allocated memory is still 226.5MB. Free memory was 89.8MB in the beginning and 88.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 bitwiseOr at line 96, overapproximation of bitwiseAnd at line 101. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_1 var_11 = 0; [L33] const SORT_5 var_15 = 0; [L34] const SORT_5 var_21 = 1; [L35] const SORT_1 var_31 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_1 input_8; [L43] SORT_5 input_9; [L44] SORT_5 input_10; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L47] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L48] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L49] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 init_13_arg_1 = var_11; [L52] state_12 = init_13_arg_1 [L53] SORT_5 init_17_arg_1 = var_15; [L54] state_16 = init_17_arg_1 [L55] SORT_1 init_19_arg_1 = var_11; [L56] state_18 = init_19_arg_1 [L57] SORT_5 init_24_arg_1 = var_15; [L58] state_23 = init_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L61] input_2 = __VERIFIER_nondet_uchar() [L62] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L62] input_2 = input_2 & mask_SORT_1 [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L64] input_3 = input_3 & mask_SORT_1 [L65] input_4 = __VERIFIER_nondet_uchar() [L66] input_6 = __VERIFIER_nondet_uchar() [L67] input_7 = __VERIFIER_nondet_uchar() [L68] input_8 = __VERIFIER_nondet_uchar() [L69] input_9 = __VERIFIER_nondet_uchar() [L70] input_10 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_14_arg_0 = state_12; [L74] SORT_1 var_14 = ~var_14_arg_0; [L75] SORT_1 var_20_arg_0 = state_18; [L76] SORT_5 var_20_arg_1 = state_16; [L77] SORT_5 var_20_arg_2 = input_7; [L78] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_31=1] [L79] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_21=1, var_31=1] [L79] var_20 = var_20 & mask_SORT_5 [L80] SORT_5 var_22_arg_0 = var_20; [L81] SORT_5 var_22_arg_1 = var_21; [L82] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L83] SORT_1 var_25_arg_0 = state_18; [L84] SORT_5 var_25_arg_1 = state_23; [L85] SORT_5 var_25_arg_2 = input_7; [L86] SORT_5 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_25=0, var_31=1] [L87] EXPR var_25 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_31=1] [L87] var_25 = var_25 & mask_SORT_5 [L88] SORT_5 var_26_arg_0 = var_25; [L89] SORT_5 var_26_arg_1 = var_21; [L90] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L91] SORT_1 var_27_arg_0 = var_22; [L92] SORT_1 var_27_arg_1 = var_26; [L93] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L94] SORT_1 var_28_arg_0 = var_14; [L95] SORT_1 var_28_arg_1 = var_27; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_28_arg_0=-1, var_28_arg_1=1, var_31=1] [L96] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L96] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L97] SORT_1 var_32_arg_0 = var_28; [L98] SORT_1 var_32 = ~var_32_arg_0; [L99] SORT_1 var_33_arg_0 = var_31; [L100] SORT_1 var_33_arg_1 = var_32; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-1] [L101] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L101] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L102] EXPR var_33 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L102] var_33 = var_33 & mask_SORT_1 [L103] SORT_1 bad_34_arg_0 = var_33; [L104] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 1778 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1363 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 415 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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-18 17:03:31,268 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/hardware-verification-bv/btor2c-lazyMod.cal57.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:03:33,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:03:33,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-18 17:03:33,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:03:33,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:03:33,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:03:33,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:03:33,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:03:33,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:03:33,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:03:33,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:03:33,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:03:33,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:03:33,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:03:33,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:03:33,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:03:33,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:03:33,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:03:33,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:03:33,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:03:33,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:03:33,573 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 17:03:33,573 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 17:03:33,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:03:33,574 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 17:03:33,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:03:33,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:03:33,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:03:33,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:03:33,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:03:33,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:03:33,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:03:33,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:03:33,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:03:33,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:03:33,578 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 17:03:33,579 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 17:03:33,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:03:33,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:03:33,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:03:33,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:03:33,580 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2024-11-18 17:03:33,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:03:33,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:03:33,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:03:33,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:03:33,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:03:33,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-18 17:03:35,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:03:35,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:03:35,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-18 17:03:35,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775c0c4ec/f568ccb34e7d42b5ab9cafc3fec5deff/FLAGa87e2543a [2024-11-18 17:03:35,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775c0c4ec/f568ccb34e7d42b5ab9cafc3fec5deff [2024-11-18 17:03:35,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:03:35,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:03:35,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:03:35,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:03:35,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:03:35,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:03:35" (1/1) ... [2024-11-18 17:03:35,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40bc6e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:35, skipping insertion in model container [2024-11-18 17:03:35,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:03:35" (1/1) ... [2024-11-18 17:03:35,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:03:36,094 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/hardware-verification-bv/btor2c-lazyMod.cal57.c[1245,1258] [2024-11-18 17:03:36,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:03:36,179 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:03:36,194 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/hardware-verification-bv/btor2c-lazyMod.cal57.c[1245,1258] [2024-11-18 17:03:36,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:03:36,256 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:03:36,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36 WrapperNode [2024-11-18 17:03:36,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:03:36,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:03:36,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:03:36,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:03:36,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,316 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 184 [2024-11-18 17:03:36,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:03:36,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:03:36,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:03:36,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:03:36,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,381 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-18 17:03:36,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:03:36,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:03:36,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:03:36,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:03:36,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (1/1) ... [2024-11-18 17:03:36,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:03:36,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:03:36,444 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-18 17:03:36,447 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-18 17:03:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:03:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 17:03:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-18 17:03:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:03:36,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:03:36,621 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:03:36,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:03:36,896 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-18 17:03:36,900 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:03:36,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:03:36,912 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:03:36,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:03:36 BoogieIcfgContainer [2024-11-18 17:03:36,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:03:36,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:03:36,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:03:36,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:03:36,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:03:35" (1/3) ... [2024-11-18 17:03:36,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9474af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:03:36, skipping insertion in model container [2024-11-18 17:03:36,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:03:36" (2/3) ... [2024-11-18 17:03:36,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9474af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:03:36, skipping insertion in model container [2024-11-18 17:03:36,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:03:36" (3/3) ... [2024-11-18 17:03:36,921 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2024-11-18 17:03:36,938 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:03:36,938 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:03:37,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:03:37,007 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;@585b004d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:03:37,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:03:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-18 17:03:37,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:03:37,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-18 17:03:37,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:03:37,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:03:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-18 17:03:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:03:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544323114] [2024-11-18 17:03:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:03:37,044 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-18 17:03:37,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:03:37,047 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-18 17:03:37,048 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-18 17:03:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:03:37,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 17:03:37,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:03:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:03:37,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 17:03:37,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:03:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544323114] [2024-11-18 17:03:37,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544323114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:03:37,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:03:37,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:03:37,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946490801] [2024-11-18 17:03:37,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:03:37,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:03:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:03:37,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:03:37,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:03:37,428 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:03:37,473 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-18 17:03:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:03:37,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-18 17:03:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:03:37,484 INFO L225 Difference]: With dead ends: 18 [2024-11-18 17:03:37,484 INFO L226 Difference]: Without dead ends: 10 [2024-11-18 17:03:37,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:03:37,491 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:03:37,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:03:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-18 17:03:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-18 17:03:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-18 17:03:37,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-18 17:03:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:03:37,522 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-18 17:03:37,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-18 17:03:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-18 17:03:37,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:03:37,523 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-18 17:03:37,530 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-18 17:03:37,726 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-18 17:03:37,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:03:37,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:03:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-18 17:03:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:03:37,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593567382] [2024-11-18 17:03:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:03:37,731 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-18 17:03:37,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:03:37,735 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-18 17:03:37,736 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-18 17:03:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:03:37,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-18 17:03:37,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:03:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:03:38,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:03:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:03:39,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:03:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593567382] [2024-11-18 17:03:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593567382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:03:39,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:03:39,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-18 17:03:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668125776] [2024-11-18 17:03:39,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:03:39,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 17:03:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:03:39,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 17:03:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-18 17:03:39,697 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:03:39,793 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-18 17:03:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 17:03:39,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-18 17:03:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:03:39,795 INFO L225 Difference]: With dead ends: 14 [2024-11-18 17:03:39,795 INFO L226 Difference]: Without dead ends: 12 [2024-11-18 17:03:39,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-18 17:03:39,797 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:03:39,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:03:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-18 17:03:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-18 17:03:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-18 17:03:39,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-18 17:03:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:03:39,804 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-18 17:03:39,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:03:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-18 17:03:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-18 17:03:39,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:03:39,805 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-18 17:03:39,811 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 (3)] Ended with exit code 0 [2024-11-18 17:03:40,008 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-18 17:03:40,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:03:40,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:03:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-18 17:03:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:03:40,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757872753] [2024-11-18 17:03:40,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 17:03:40,011 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-18 17:03:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:03:40,015 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-18 17:03:40,019 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-18 17:03:40,158 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 17:03:40,158 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:03:40,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-18 17:03:40,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:03:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:03:41,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:04:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:04:02,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:04:02,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757872753] [2024-11-18 17:04:02,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757872753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:04:02,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:04:02,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-18 17:04:02,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876974258] [2024-11-18 17:04:02,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:04:02,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 17:04:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:04:02,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 17:04:02,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-18 17:04:02,588 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:04:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:04:02,815 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-18 17:04:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 17:04:02,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-18 17:04:02,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:04:02,816 INFO L225 Difference]: With dead ends: 17 [2024-11-18 17:04:02,816 INFO L226 Difference]: Without dead ends: 15 [2024-11-18 17:04:02,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-18 17:04:02,817 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:04:02,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:04:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-18 17:04:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-18 17:04:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:04:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-18 17:04:02,822 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-18 17:04:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:04:02,822 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-18 17:04:02,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:04:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-18 17:04:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 17:04:02,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:04:02,823 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-18 17:04:02,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 17:04:03,025 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-18 17:04:03,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:04:03,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:04:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-18 17:04:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:04:03,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654844614] [2024-11-18 17:04:03,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 17:04:03,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 17:04:03,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:04:03,031 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-18 17:04:03,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 17:04:03,183 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-18 17:04:03,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:04:03,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-18 17:04:03,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:04:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 17:04:04,277 INFO L311 TraceCheckSpWp]: Computing backward predicates...