./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.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 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:00:34,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:00:34,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 03:00:34,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:00:34,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:00:34,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:00:34,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:00:34,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:00:34,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:00:34,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:00:34,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:00:34,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:00:34,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:00:34,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:00:34,381 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:00:34,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:00:34,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:00:34,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:00:34,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:00:34,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:00:34,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:00:34,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:00:34,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:00:34,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:00:34,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:00:34,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:00:34,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:00:34,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:00:34,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:00:34,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:00:34,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:00:34,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:00:34,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:00:34,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:00:34,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:00:34,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:00:34,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:00:34,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:00:34,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:00:34,388 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 -> 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 [2024-11-10 03:00:34,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:00:34,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:00:34,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:00:34,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:00:34,690 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:00:34,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-11-10 03:00:36,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:00:36,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:00:36,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-11-10 03:00:36,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00633ce77/1c1f8b8d30484bcdb6196fcf67555ae1/FLAG3e0fabea2 [2024-11-10 03:00:36,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00633ce77/1c1f8b8d30484bcdb6196fcf67555ae1 [2024-11-10 03:00:36,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:00:36,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:00:36,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:00:36,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:00:36,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:00:36,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:00:36" (1/1) ... [2024-11-10 03:00:36,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4879786b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:36, skipping insertion in model container [2024-11-10 03:00:36,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:00:36" (1/1) ... [2024-11-10 03:00:36,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:00:37,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c[1258,1271] [2024-11-10 03:00:37,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:00:37,175 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:00:37,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c[1258,1271] [2024-11-10 03:00:37,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:00:37,259 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:00:37,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37 WrapperNode [2024-11-10 03:00:37,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:00:37,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:00:37,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:00:37,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:00:37,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,378 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 617 [2024-11-10 03:00:37,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:00:37,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:00:37,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:00:37,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:00:37,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,471 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:00:37,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:00:37,548 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:00:37,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:00:37,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:00:37,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (1/1) ... [2024-11-10 03:00:37,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:00:37,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:00:37,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:00:37,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:00:37,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:00:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:00:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:00:37,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:00:37,833 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:00:37,835 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:00:38,410 INFO L? ?]: Removed 316 outVars from TransFormulas that were not future-live. [2024-11-10 03:00:38,411 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:00:38,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:00:38,454 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:00:38,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:38 BoogieIcfgContainer [2024-11-10 03:00:38,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:00:38,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:00:38,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:00:38,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:00:38,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:00:36" (1/3) ... [2024-11-10 03:00:38,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9e7899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:00:38, skipping insertion in model container [2024-11-10 03:00:38,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:37" (2/3) ... [2024-11-10 03:00:38,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9e7899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:00:38, skipping insertion in model container [2024-11-10 03:00:38,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:38" (3/3) ... [2024-11-10 03:00:38,466 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-11-10 03:00:38,483 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:00:38,483 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:00:38,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:00:38,549 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;@1bcdfd51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:00:38,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:00:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 120 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 03:00:38,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:38,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:38,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:38,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:38,569 INFO L85 PathProgramCache]: Analyzing trace with hash 647898633, now seen corresponding path program 1 times [2024-11-10 03:00:38,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:38,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433466749] [2024-11-10 03:00:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:00:39,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:39,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433466749] [2024-11-10 03:00:39,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433466749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:39,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:39,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:00:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060378191] [2024-11-10 03:00:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:39,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:00:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:39,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:00:39,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:39,236 INFO L87 Difference]: Start difference. First operand has 121 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 120 states have internal predecessors, (176), 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 10.0) internal successors, (40), 4 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-11-10 03:00:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:39,330 INFO L93 Difference]: Finished difference Result 197 states and 289 transitions. [2024-11-10 03:00:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:00:39,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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) Word has length 40 [2024-11-10 03:00:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:39,339 INFO L225 Difference]: With dead ends: 197 [2024-11-10 03:00:39,339 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 03:00:39,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:39,344 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:39,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:00:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 03:00:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-10 03:00:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4700854700854702) internal successors, (172), 117 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-10 03:00:39,384 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 40 [2024-11-10 03:00:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:39,385 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-10 03:00:39,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-11-10 03:00:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-10 03:00:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 03:00:39,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:39,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:39,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:00:39,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:39,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1244925410, now seen corresponding path program 1 times [2024-11-10 03:00:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:39,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10487687] [2024-11-10 03:00:39,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:39,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:00:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10487687] [2024-11-10 03:00:39,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10487687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:39,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:39,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:00:39,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119256566] [2024-11-10 03:00:39,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:39,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:00:39,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:39,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:00:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:39,633 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:39,753 INFO L93 Difference]: Finished difference Result 196 states and 285 transitions. [2024-11-10 03:00:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:00:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-11-10 03:00:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:39,755 INFO L225 Difference]: With dead ends: 196 [2024-11-10 03:00:39,755 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 03:00:39,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:39,756 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:39,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:00:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 03:00:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-10 03:00:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 119 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2024-11-10 03:00:39,771 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 41 [2024-11-10 03:00:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:39,773 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2024-11-10 03:00:39,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2024-11-10 03:00:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 03:00:39,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:39,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:39,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:00:39,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:39,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash -190738418, now seen corresponding path program 1 times [2024-11-10 03:00:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:39,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609473780] [2024-11-10 03:00:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:00:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609473780] [2024-11-10 03:00:40,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609473780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:40,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:40,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:00:40,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192382634] [2024-11-10 03:00:40,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:40,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:00:40,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:40,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:00:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:00:40,429 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:40,746 INFO L93 Difference]: Finished difference Result 276 states and 398 transitions. [2024-11-10 03:00:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:00:40,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 42 [2024-11-10 03:00:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:40,749 INFO L225 Difference]: With dead ends: 276 [2024-11-10 03:00:40,750 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 03:00:40,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:00:40,754 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 355 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:40,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 638 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:00:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 03:00:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 141. [2024-11-10 03:00:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.457142857142857) internal successors, (204), 140 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-10 03:00:40,766 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 42 [2024-11-10 03:00:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:40,766 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-10 03:00:40,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-10 03:00:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 03:00:40,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:40,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:40,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:00:40,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:40,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:40,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1086739097, now seen corresponding path program 1 times [2024-11-10 03:00:40,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:40,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133426795] [2024-11-10 03:00:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:00:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133426795] [2024-11-10 03:00:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133426795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:41,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:00:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261237890] [2024-11-10 03:00:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:00:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:00:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:00:41,111 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:41,280 INFO L93 Difference]: Finished difference Result 223 states and 322 transitions. [2024-11-10 03:00:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:00:41,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2024-11-10 03:00:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:41,282 INFO L225 Difference]: With dead ends: 223 [2024-11-10 03:00:41,285 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 03:00:41,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:00:41,286 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 139 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:41,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 521 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:00:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 03:00:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2024-11-10 03:00:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.457142857142857) internal successors, (204), 140 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-10 03:00:41,299 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 43 [2024-11-10 03:00:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:41,299 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-10 03:00:41,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-10 03:00:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 03:00:41,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:41,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:41,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:00:41,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:41,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash -8923789, now seen corresponding path program 1 times [2024-11-10 03:00:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:41,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963511640] [2024-11-10 03:00:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:00:41,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:00:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:00:41,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:00:41,378 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:00:41,379 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:00:41,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:00:41,383 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 03:00:41,417 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:00:41,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:00:41 BoogieIcfgContainer [2024-11-10 03:00:41,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:00:41,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:00:41,421 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:00:41,421 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:00:41,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:38" (3/4) ... [2024-11-10 03:00:41,424 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:00:41,425 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:00:41,425 INFO L158 Benchmark]: Toolchain (without parser) took 4518.95ms. Allocated memory was 167.8MB in the beginning and 262.1MB in the end (delta: 94.4MB). Free memory was 113.6MB in the beginning and 200.9MB in the end (delta: -87.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-10 03:00:41,426 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:00:41,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.94ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 91.5MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 03:00:41,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.15ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 79.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 03:00:41,426 INFO L158 Benchmark]: Boogie Preprocessor took 164.10ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 71.4MB in the end (delta: 8.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 03:00:41,427 INFO L158 Benchmark]: IcfgBuilder took 907.28ms. Allocated memory was 167.8MB in the beginning and 262.1MB in the end (delta: 94.4MB). Free memory was 71.4MB in the beginning and 157.7MB in the end (delta: -86.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-10 03:00:41,427 INFO L158 Benchmark]: TraceAbstraction took 2962.97ms. Allocated memory is still 262.1MB. Free memory was 156.7MB in the beginning and 200.9MB in the end (delta: -44.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:00:41,427 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 262.1MB. Free memory is still 200.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:00:41,428 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.20ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.94ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 91.5MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.15ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 79.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 164.10ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 71.4MB in the end (delta: 8.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 907.28ms. Allocated memory was 167.8MB in the beginning and 262.1MB in the end (delta: 94.4MB). Free memory was 71.4MB in the beginning and 157.7MB in the end (delta: -86.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2962.97ms. Allocated memory is still 262.1MB. Free memory was 156.7MB in the beginning and 200.9MB in the end (delta: -44.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 262.1MB. Free memory is still 200.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 149. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 32); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (32 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 2); [L33] const SORT_16 msb_SORT_16 = (SORT_16)1 << (2 - 1); [L35] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 3); [L36] const SORT_59 msb_SORT_59 = (SORT_59)1 << (3 - 1); [L38] const SORT_16 var_17 = 0; [L39] const SORT_16 var_20 = 3; [L40] const SORT_3 var_22 = 1; [L41] const SORT_3 var_36 = 0; [L42] const SORT_16 var_77 = 2; [L43] const SORT_16 var_80 = 1; [L44] const SORT_59 var_92 = 0; [L46] SORT_1 input_2; [L47] SORT_3 input_4; [L48] SORT_1 input_5; [L49] SORT_3 input_6; [L50] SORT_3 input_7; [L51] SORT_3 input_8; [L52] SORT_1 input_9; [L53] SORT_3 input_10; [L54] SORT_3 input_11; [L55] SORT_1 input_12; [L56] SORT_3 input_13; [L57] SORT_3 input_14; [L58] SORT_3 input_15; [L59] SORT_1 input_32; [L60] SORT_3 input_34; [L61] SORT_1 input_39; [L62] SORT_3 input_41; [L63] SORT_1 input_47; [L64] SORT_1 input_53; [L65] SORT_1 input_55; [L66] SORT_1 input_57; [L67] SORT_59 input_60; [L68] SORT_59 input_66; [L69] SORT_1 input_69; [L70] SORT_3 input_73; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_16 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L72] SORT_16 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_16; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L73] SORT_3 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L74] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L75] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L76] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L77] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L78] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L79] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L80] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L81] SORT_3 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_16 init_19_arg_1 = var_17; [L84] state_18 = init_19_arg_1 [L85] SORT_3 init_24_arg_1 = var_22; [L86] state_23 = init_24_arg_1 [L87] SORT_3 init_38_arg_1 = var_36; [L88] state_37 = init_38_arg_1 [L89] SORT_3 init_44_arg_1 = var_36; [L90] state_43 = init_44_arg_1 [L91] SORT_3 init_46_arg_1 = var_36; [L92] state_45 = init_46_arg_1 [L93] SORT_3 init_50_arg_1 = var_36; [L94] state_49 = init_50_arg_1 [L95] SORT_3 init_52_arg_1 = var_36; [L96] state_51 = init_52_arg_1 [L97] SORT_3 init_63_arg_1 = var_36; [L98] state_62 = init_63_arg_1 [L99] SORT_3 init_65_arg_1 = var_36; [L100] state_64 = init_65_arg_1 [L101] SORT_3 init_72_arg_1 = var_36; [L102] state_71 = init_72_arg_1 VAL [mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L105] input_2 = __VERIFIER_nondet_uint() [L106] input_4 = __VERIFIER_nondet_uchar() [L107] input_5 = __VERIFIER_nondet_uint() [L108] input_6 = __VERIFIER_nondet_uchar() [L109] input_7 = __VERIFIER_nondet_uchar() [L110] EXPR input_7 & mask_SORT_3 VAL [mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L110] input_7 = input_7 & mask_SORT_3 [L111] input_8 = __VERIFIER_nondet_uchar() [L112] EXPR input_8 & mask_SORT_3 VAL [input_7=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L112] input_8 = input_8 & mask_SORT_3 [L113] input_9 = __VERIFIER_nondet_uint() [L114] input_10 = __VERIFIER_nondet_uchar() [L115] EXPR input_10 & mask_SORT_3 VAL [input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L115] input_10 = input_10 & mask_SORT_3 [L116] input_11 = __VERIFIER_nondet_uchar() [L117] EXPR input_11 & mask_SORT_3 VAL [input_10=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L117] input_11 = input_11 & mask_SORT_3 [L118] input_12 = __VERIFIER_nondet_uint() [L119] input_13 = __VERIFIER_nondet_uchar() [L120] input_14 = __VERIFIER_nondet_uchar() [L121] input_15 = __VERIFIER_nondet_uchar() [L122] input_32 = __VERIFIER_nondet_uint() [L123] input_34 = __VERIFIER_nondet_uchar() [L124] input_39 = __VERIFIER_nondet_uint() [L125] input_41 = __VERIFIER_nondet_uchar() [L126] input_47 = __VERIFIER_nondet_uint() [L127] input_53 = __VERIFIER_nondet_uint() [L128] input_55 = __VERIFIER_nondet_uint() [L129] input_57 = __VERIFIER_nondet_uint() [L130] input_60 = __VERIFIER_nondet_uchar() [L131] input_66 = __VERIFIER_nondet_uchar() [L132] input_69 = __VERIFIER_nondet_uint() [L133] input_73 = __VERIFIER_nondet_uchar() [L136] SORT_16 var_21_arg_0 = state_18; [L137] SORT_16 var_21_arg_1 = var_20; [L138] SORT_3 var_21 = var_21_arg_0 != var_21_arg_1; [L139] SORT_3 var_25_arg_0 = state_23; [L140] SORT_3 var_25_arg_1 = var_22; [L141] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L142] SORT_3 var_26_arg_0 = var_21; [L143] SORT_3 var_26_arg_1 = var_25; VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_26_arg_0=1, var_26_arg_1=1, var_36=0, var_77=2, var_80=1, var_92=0] [L144] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L144] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L145] SORT_3 var_29_arg_0 = var_26; [L146] SORT_3 var_29 = ~var_29_arg_0; [L147] SORT_3 var_30_arg_0 = var_22; [L148] SORT_3 var_30_arg_1 = var_29; VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_30_arg_0=1, var_30_arg_1=-2, var_36=0, var_77=2, var_80=1, var_92=0] [L149] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L149] SORT_3 var_30 = var_30_arg_0 & var_30_arg_1; [L150] EXPR var_30 & mask_SORT_3 VAL [input_10=0, input_11=0, input_7=0, input_8=0, mask_SORT_16=3, mask_SORT_3=1, state_18=0, state_23=1, state_37=0, state_43=0, state_45=0, state_49=0, state_51=0, state_62=0, state_64=0, state_71=0, var_17=0, var_20=3, var_22=1, var_36=0, var_77=2, var_80=1, var_92=0] [L150] var_30 = var_30 & mask_SORT_3 [L151] SORT_3 bad_31_arg_0 = var_30; [L152] CALL __VERIFIER_assert(!(bad_31_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 494 mSDsluCounter, 1992 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1449 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 543 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 61 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:00:41,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.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 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:00:43,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:00:43,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 03:00:43,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:00:43,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:00:43,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:00:43,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:00:43,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:00:43,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:00:43,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:00:43,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:00:43,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:00:43,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:00:43,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:00:43,746 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:00:43,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:00:43,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:00:43,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:00:43,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:00:43,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:00:43,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:00:43,751 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:00:43,751 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:00:43,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:00:43,755 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:00:43,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:00:43,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:00:43,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:00:43,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:00:43,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:00:43,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:00:43,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:00:43,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:00:43,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:00:43,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:00:43,757 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:00:43,758 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:00:43,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:00:43,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:00:43,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:00:43,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:00:43,759 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 -> 1ef8d174762b17df623a48d7afe94f1e8bc5e2233dcaad9b42847f8ac912d010 [2024-11-10 03:00:44,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:00:44,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:00:44,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:00:44,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:00:44,045 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:00:44,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-11-10 03:00:45,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:00:45,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:00:45,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-11-10 03:00:45,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2858371/46660a1ab00d420a9b6b98a834146308/FLAGe70b9d6c8 [2024-11-10 03:00:46,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2858371/46660a1ab00d420a9b6b98a834146308 [2024-11-10 03:00:46,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:00:46,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:00:46,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:00:46,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:00:46,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:00:46,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589a697f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46, skipping insertion in model container [2024-11-10 03:00:46,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:00:46,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c[1258,1271] [2024-11-10 03:00:46,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:00:46,512 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:00:46,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_bcuvis32.c[1258,1271] [2024-11-10 03:00:46,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:00:46,602 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:00:46,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46 WrapperNode [2024-11-10 03:00:46,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:00:46,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:00:46,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:00:46,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:00:46,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,663 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 401 [2024-11-10 03:00:46,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:00:46,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:00:46,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:00:46,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:00:46,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,700 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:00:46,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:00:46,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:00:46,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:00:46,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:00:46,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (1/1) ... [2024-11-10 03:00:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:00:46,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:00:46,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:00:46,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:00:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:00:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:00:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:00:46,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:00:47,040 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:00:47,043 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:00:47,395 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-10 03:00:47,396 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:00:47,407 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:00:47,407 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:00:47,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:47 BoogieIcfgContainer [2024-11-10 03:00:47,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:00:47,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:00:47,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:00:47,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:00:47,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:00:46" (1/3) ... [2024-11-10 03:00:47,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a6c236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:00:47, skipping insertion in model container [2024-11-10 03:00:47,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:46" (2/3) ... [2024-11-10 03:00:47,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a6c236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:00:47, skipping insertion in model container [2024-11-10 03:00:47,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:47" (3/3) ... [2024-11-10 03:00:47,417 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_bcuvis32.c [2024-11-10 03:00:47,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:00:47,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:00:47,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:00:47,491 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;@11829c1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:00:47,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:00:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 03:00:47,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:47,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 03:00:47,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:47,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 03:00:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:00:47,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724481798] [2024-11-10 03:00:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:47,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:00:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:00:47,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:00:47,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:00:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:47,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 03:00:47,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:00:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:00:47,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:00:47,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:00:47,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724481798] [2024-11-10 03:00:47,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724481798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:47,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:47,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:00:47,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424473046] [2024-11-10 03:00:47,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:47,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:00:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:00:47,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:00:47,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:47,845 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:47,891 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 03:00:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:00:47,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-10 03:00:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:47,899 INFO L225 Difference]: With dead ends: 22 [2024-11-10 03:00:47,899 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 03:00:47,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:00:47,903 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:47,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:00:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 03:00:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 03:00:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 03:00:47,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 03:00:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:47,924 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 03:00:47,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 03:00:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 03:00:47,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:47,925 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:47,929 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:00:48,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:00:48,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:48,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:48,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 03:00:48,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:00:48,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918383409] [2024-11-10 03:00:48,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:48,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:00:48,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:00:48,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:00:48,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:00:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:48,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 03:00:48,289 INFO L278 TraceCheckSpWp]: Computing forward predicates...