./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.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 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:39:52,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:39:52,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:39:52,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:39:52,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:39:52,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:39:52,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:39:52,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:39:52,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:39:52,956 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:39:52,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:39:52,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:39:52,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:39:52,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:39:52,958 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:39:52,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:39:52,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:39:52,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:39:52,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:39:52,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:39:52,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:39:52,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:39:52,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:39:52,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:39:52,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:39:52,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:39:52,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:39:52,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:39:52,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:39:52,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:39:52,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:39:52,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:39:52,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:39:52,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:39:52,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:39:52,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:39:52,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:39:52,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:39:52,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:39:52,967 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 -> 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d [2024-10-12 22:39:53,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:39:53,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:39:53,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:39:53,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:39:53,238 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:39:53,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-10-12 22:39:54,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:39:54,870 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:39:54,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-10-12 22:39:54,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e4fc625/73ba4b1aa73c4ad3b91ff24b27a129c5/FLAG28c983caf [2024-10-12 22:39:54,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e4fc625/73ba4b1aa73c4ad3b91ff24b27a129c5 [2024-10-12 22:39:54,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:39:54,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:39:54,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:39:54,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:39:54,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:39:54,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:39:54" (1/1) ... [2024-10-12 22:39:54,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102b2834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:54, skipping insertion in model container [2024-10-12 22:39:54,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:39:54" (1/1) ... [2024-10-12 22:39:54,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:39:55,171 WARN L248 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.counter.c[1247,1260] [2024-10-12 22:39:55,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:39:55,235 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:39:55,246 WARN L248 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.counter.c[1247,1260] [2024-10-12 22:39:55,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:39:55,284 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:39:55,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55 WrapperNode [2024-10-12 22:39:55,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:39:55,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:39:55,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:39:55,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:39:55,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,331 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2024-10-12 22:39:55,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:39:55,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:39:55,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:39:55,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:39:55,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,375 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 22:39:55,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:39:55,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:39:55,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:39:55,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:39:55,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (1/1) ... [2024-10-12 22:39:55,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:39:55,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:39:55,437 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-10-12 22:39:55,440 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-10-12 22:39:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:39:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:39:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:39:55,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:39:55,540 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:39:55,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:39:55,788 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-12 22:39:55,789 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:39:55,819 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:39:55,820 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:39:55,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:39:55 BoogieIcfgContainer [2024-10-12 22:39:55,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:39:55,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:39:55,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:39:55,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:39:55,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:39:54" (1/3) ... [2024-10-12 22:39:55,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0ad381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:39:55, skipping insertion in model container [2024-10-12 22:39:55,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:39:55" (2/3) ... [2024-10-12 22:39:55,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0ad381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:39:55, skipping insertion in model container [2024-10-12 22:39:55,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:39:55" (3/3) ... [2024-10-12 22:39:55,830 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter.c [2024-10-12 22:39:55,843 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:39:55,844 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:39:55,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:39:55,903 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;@7cfddece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:39:55,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:39:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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-10-12 22:39:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 22:39:55,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:39:55,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:39:55,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:39:55,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:39:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1651861999, now seen corresponding path program 1 times [2024-10-12 22:39:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:39:55,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674774872] [2024-10-12 22:39:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:39:55,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:39:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:39:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:39:56,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:39:56,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674774872] [2024-10-12 22:39:56,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674774872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:39:56,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:39:56,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:39:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118566564] [2024-10-12 22:39:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:39:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:39:56,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:39:56,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:39:56,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:39:56,466 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 3.0) internal successors, (12), 4 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-10-12 22:39:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:39:56,512 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2024-10-12 22:39:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:39:56,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) Word has length 12 [2024-10-12 22:39:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:39:56,522 INFO L225 Difference]: With dead ends: 50 [2024-10-12 22:39:56,522 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 22:39:56,525 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-10-12 22:39:56,528 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:39:56,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:39:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 22:39:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 22:39:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-10-12 22:39:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-12 22:39:56,555 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2024-10-12 22:39:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:39:56,555 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-12 22:39:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-10-12 22:39:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-12 22:39:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 22:39:56,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:39:56,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:39:56,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:39:56,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:39:56,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:39:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash 333580788, now seen corresponding path program 1 times [2024-10-12 22:39:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:39:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340630049] [2024-10-12 22:39:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:39:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:39:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:39:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:39:56,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:39:56,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340630049] [2024-10-12 22:39:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340630049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:39:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:39:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:39:56,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842518237] [2024-10-12 22:39:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:39:56,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:39:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:39:56,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:39:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:39:56,692 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-12 22:39:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:39:56,717 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-10-12 22:39:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:39:56,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-10-12 22:39:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:39:56,719 INFO L225 Difference]: With dead ends: 53 [2024-10-12 22:39:56,719 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 22:39:56,719 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-10-12 22:39:56,720 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:39:56,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:39:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 22:39:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-12 22:39:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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-10-12 22:39:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2024-10-12 22:39:56,725 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 13 [2024-10-12 22:39:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:39:56,725 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2024-10-12 22:39:56,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-12 22:39:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-10-12 22:39:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 22:39:56,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:39:56,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:39:56,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:39:56,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:39:56,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:39:56,727 INFO L85 PathProgramCache]: Analyzing trace with hash 653103946, now seen corresponding path program 1 times [2024-10-12 22:39:56,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:39:56,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282209554] [2024-10-12 22:39:56,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:39:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:39:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:39:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:39:56,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:39:56,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282209554] [2024-10-12 22:39:56,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282209554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:39:56,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:39:56,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 22:39:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567858939] [2024-10-12 22:39:56,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:39:56,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:39:56,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:39:56,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:39:56,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:39:56,886 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-10-12 22:39:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:39:56,928 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2024-10-12 22:39:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:39:56,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 14 [2024-10-12 22:39:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:39:56,929 INFO L225 Difference]: With dead ends: 53 [2024-10-12 22:39:56,930 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 22:39:56,931 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-10-12 22:39:56,933 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:39:56,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 57 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:39:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 22:39:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 22:39:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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-10-12 22:39:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-12 22:39:56,939 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2024-10-12 22:39:56,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:39:56,939 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-12 22:39:56,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-10-12 22:39:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-12 22:39:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 22:39:56,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:39:56,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:39:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:39:56,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:39:56,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:39:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash 335930999, now seen corresponding path program 1 times [2024-10-12 22:39:56,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:39:56,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123042419] [2024-10-12 22:39:56,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:39:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:39:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:39:56,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 22:39:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:39:57,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 22:39:57,031 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 22:39:57,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 22:39:57,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:39:57,037 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-12 22:39:57,066 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 22:39:57,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:39:57 BoogieIcfgContainer [2024-10-12 22:39:57,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 22:39:57,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 22:39:57,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 22:39:57,074 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 22:39:57,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:39:55" (3/4) ... [2024-10-12 22:39:57,078 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 22:39:57,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 22:39:57,080 INFO L158 Benchmark]: Toolchain (without parser) took 2188.20ms. Allocated memory is still 159.4MB. Free memory was 105.1MB in the beginning and 56.7MB in the end (delta: 48.5MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-10-12 22:39:57,081 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:39:57,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.26ms. Allocated memory is still 159.4MB. Free memory was 104.7MB in the beginning and 127.1MB in the end (delta: -22.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 22:39:57,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.78ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 123.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 22:39:57,083 INFO L158 Benchmark]: Boogie Preprocessor took 62.66ms. Allocated memory is still 159.4MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 22:39:57,084 INFO L158 Benchmark]: RCFGBuilder took 425.48ms. Allocated memory is still 159.4MB. Free memory was 120.8MB in the beginning and 102.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 22:39:57,084 INFO L158 Benchmark]: TraceAbstraction took 1250.32ms. Allocated memory is still 159.4MB. Free memory was 101.4MB in the beginning and 56.7MB in the end (delta: 44.7MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2024-10-12 22:39:57,084 INFO L158 Benchmark]: Witness Printer took 5.87ms. Allocated memory is still 159.4MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:39:57,086 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 96.5MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.26ms. Allocated memory is still 159.4MB. Free memory was 104.7MB in the beginning and 127.1MB in the end (delta: -22.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.78ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 123.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.66ms. Allocated memory is still 159.4MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.48ms. Allocated memory is still 159.4MB. Free memory was 120.8MB in the beginning and 102.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1250.32ms. Allocated memory is still 159.4MB. Free memory was 101.4MB in the beginning and 56.7MB in the end (delta: 44.7MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Witness Printer took 5.87ms. Allocated memory is still 159.4MB. Free memory is still 56.7MB. 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 bitwiseAnd at line 58. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 1; [L33] const SORT_4 var_8 = 0; [L34] const SORT_1 var_12 = 1; [L35] const SORT_4 var_18 = 15; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_18=15, var_5=1, var_8=0] [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L42] SORT_4 init_7_arg_1 = var_5; [L43] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_3 = __VERIFIER_nondet_uchar() [L48] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_9_arg_0 = state_6; [L52] SORT_4 var_9_arg_1 = var_8; [L53] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L54] SORT_1 var_13_arg_0 = var_9; [L55] SORT_1 var_13 = ~var_13_arg_0; [L56] SORT_1 var_14_arg_0 = var_12; [L57] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_18=15, var_5=1, var_8=0] [L58] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L58] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L59] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L59] var_14 = var_14 & mask_SORT_1 [L60] SORT_1 bad_15_arg_0 = var_14; [L61] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 95 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-10-12 22:39:57,118 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.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 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:39:59,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:39:59,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 22:39:59,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:39:59,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:39:59,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:39:59,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:39:59,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:39:59,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:39:59,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:39:59,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:39:59,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:39:59,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:39:59,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:39:59,366 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:39:59,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:39:59,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:39:59,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:39:59,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:39:59,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:39:59,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:39:59,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 22:39:59,372 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 22:39:59,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:39:59,373 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 22:39:59,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:39:59,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:39:59,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:39:59,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:39:59,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:39:59,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:39:59,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:39:59,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:39:59,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:39:59,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:39:59,376 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 22:39:59,376 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 22:39:59,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:39:59,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:39:59,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:39:59,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:39:59,378 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 22:39:59,378 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 -> 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d [2024-10-12 22:39:59,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:39:59,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:39:59,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:39:59,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:39:59,732 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:39:59,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-10-12 22:40:01,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:40:01,530 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:40:01,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-10-12 22:40:01,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5438954/ee59c88430d54b7c9186c0f3ab906ef5/FLAG1b3a0d8c1 [2024-10-12 22:40:01,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5438954/ee59c88430d54b7c9186c0f3ab906ef5 [2024-10-12 22:40:01,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:40:01,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:40:01,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:40:01,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:40:01,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:40:01,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8fd519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01, skipping insertion in model container [2024-10-12 22:40:01,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:40:01,765 WARN L248 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.counter.c[1247,1260] [2024-10-12 22:40:01,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:40:01,826 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:40:01,841 WARN L248 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.counter.c[1247,1260] [2024-10-12 22:40:01,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:40:01,887 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:40:01,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01 WrapperNode [2024-10-12 22:40:01,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:40:01,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:40:01,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:40:01,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:40:01,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,926 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-10-12 22:40:01,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:40:01,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:40:01,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:40:01,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:40:01,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,957 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 22:40:01,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:40:01,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:40:01,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:40:01,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:40:01,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (1/1) ... [2024-10-12 22:40:01,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:40:01,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:40:02,010 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-10-12 22:40:02,013 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-10-12 22:40:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:40:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 22:40:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:40:02,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:40:02,126 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:40:02,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:40:02,327 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-12 22:40:02,327 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:40:02,360 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:40:02,361 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:40:02,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:40:02 BoogieIcfgContainer [2024-10-12 22:40:02,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:40:02,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:40:02,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:40:02,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:40:02,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:40:01" (1/3) ... [2024-10-12 22:40:02,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497e16f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:40:02, skipping insertion in model container [2024-10-12 22:40:02,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:40:01" (2/3) ... [2024-10-12 22:40:02,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497e16f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:40:02, skipping insertion in model container [2024-10-12 22:40:02,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:40:02" (3/3) ... [2024-10-12 22:40:02,371 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter.c [2024-10-12 22:40:02,387 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:40:02,387 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:40:02,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:40:02,457 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;@11650516, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:40:02,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:40:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-10-12 22:40:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 22:40:02,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:40:02,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 22:40:02,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:40:02,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:40:02,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 22:40:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:40:02,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111626733] [2024-10-12 22:40:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:40:02,489 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-10-12 22:40:02,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:40:02,492 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-10-12 22:40:02,494 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-10-12 22:40:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:40:02,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 22:40:02,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:40:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:40:02,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:40:02,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:40:02,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111626733] [2024-10-12 22:40:02,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111626733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:40:02,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:40:02,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 22:40:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773314781] [2024-10-12 22:40:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:40:02,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:40:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:40:02,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:40:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:40:02,868 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-12 22:40:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:40:02,918 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 22:40:02,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:40:02,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-12 22:40:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:40:02,935 INFO L225 Difference]: With dead ends: 15 [2024-10-12 22:40:02,936 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 22:40:02,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-12 22:40:02,942 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 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-10-12 22:40:02,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:40:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 22:40:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 22:40:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-12 22:40:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 22:40:02,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 22:40:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:40:02,971 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 22:40:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-12 22:40:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 22:40:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 22:40:02,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:40:02,972 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 22:40:02,976 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-10-12 22:40:03,175 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-10-12 22:40:03,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:40:03,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:40:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 22:40:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:40:03,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403867293] [2024-10-12 22:40:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:40:03,180 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-10-12 22:40:03,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:40:03,182 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-10-12 22:40:03,185 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-10-12 22:40:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:40:03,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 22:40:03,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:40:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:40:03,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:40:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:40:04,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:40:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403867293] [2024-10-12 22:40:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403867293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:40:04,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:40:04,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 22:40:04,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550540648] [2024-10-12 22:40:04,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:40:04,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:40:04,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:40:04,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:40:04,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:40:04,189 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-12 22:40:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:40:04,472 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-12 22:40:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:40:04,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 7 [2024-10-12 22:40:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:40:04,473 INFO L225 Difference]: With dead ends: 17 [2024-10-12 22:40:04,473 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 22:40:04,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:40:04,475 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:40:04,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:40:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 22:40:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-12 22:40:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-12 22:40:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-12 22:40:04,480 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-12 22:40:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:40:04,480 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-12 22:40:04,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-12 22:40:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-12 22:40:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 22:40:04,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:40:04,482 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-12 22:40:04,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 22:40:04,682 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-10-12 22:40:04,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:40:04,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:40:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-12 22:40:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:40:04,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912422390] [2024-10-12 22:40:04,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 22:40:04,685 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-10-12 22:40:04,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:40:04,688 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-10-12 22:40:04,689 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-10-12 22:40:04,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 22:40:04,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:40:04,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 22:40:04,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:40:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:40:05,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:40:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:40:11,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:40:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912422390] [2024-10-12 22:40:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912422390] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:40:11,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:40:11,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-12 22:40:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954410956] [2024-10-12 22:40:11,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:40:11,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 22:40:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:40:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 22:40:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:40:11,125 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-10-12 22:40:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:40:13,457 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-10-12 22:40:13,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 22:40:13,458 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 13 [2024-10-12 22:40:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:40:13,459 INFO L225 Difference]: With dead ends: 29 [2024-10-12 22:40:13,459 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 22:40:13,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-10-12 22:40:13,461 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:40:13,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 15 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:40:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 22:40:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-12 22:40:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-10-12 22:40:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-12 22:40:13,477 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2024-10-12 22:40:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:40:13,478 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-12 22:40:13,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-10-12 22:40:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-12 22:40:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 22:40:13,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:40:13,479 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2024-10-12 22:40:13,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-12 22:40:13,680 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-10-12 22:40:13,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:40:13,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:40:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1505384042, now seen corresponding path program 3 times [2024-10-12 22:40:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:40:13,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235031597] [2024-10-12 22:40:13,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 22:40:13,682 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-10-12 22:40:13,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:40:13,686 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-10-12 22:40:13,687 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-10-12 22:40:13,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 22:40:13,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:40:13,765 WARN L253 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 22:40:13,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:40:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-12 22:40:14,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:40:41,424 WARN L286 SmtUtils]: Spent 20.56s on a formula simplification that was a NOOP. DAG size: 284 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)