./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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.eq_sdp_v2.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 c9d109b493cd6a4f14cdfea06aadcc172a16a2368d784cf5cde1e78a2b0f69e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:56:07,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:56:07,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-11 23:56:07,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:56:07,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:56:07,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:56:07,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:56:07,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:56:07,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:56:07,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:56:07,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:56:07,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:56:07,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:56:07,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:56:07,755 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:56:07,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:56:07,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:56:07,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 23:56:07,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:56:07,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:56:07,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:56:07,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:56:07,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:56:07,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:56:07,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:56:07,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:56:07,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:56:07,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:56:07,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:56:07,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:56:07,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:56:07,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:56:07,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:56:07,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 23:56:07,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 23:56:07,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:56:07,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:56:07,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:56:07,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:56:07,762 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 -> c9d109b493cd6a4f14cdfea06aadcc172a16a2368d784cf5cde1e78a2b0f69e6 [2024-11-11 23:56:07,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:56:07,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:56:07,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:56:07,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:56:07,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:56:07,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v2.c [2024-11-11 23:56:09,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:56:09,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:56:09,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v2.c [2024-11-11 23:56:09,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4aa598b/8067263dfff64174abaa64c39dc49692/FLAG9c8022863 [2024-11-11 23:56:09,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4aa598b/8067263dfff64174abaa64c39dc49692 [2024-11-11 23:56:09,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:56:09,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:56:09,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:56:09,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:56:09,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:56:09,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e33b3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09, skipping insertion in model container [2024-11-11 23:56:09,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:56:09,590 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.eq_sdp_v2.c[1249,1262] [2024-11-11 23:56:09,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:56:09,666 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:56:09,675 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.eq_sdp_v2.c[1249,1262] [2024-11-11 23:56:09,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:56:09,725 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:56:09,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09 WrapperNode [2024-11-11 23:56:09,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:56:09,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:56:09,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:56:09,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:56:09,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,787 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 415 [2024-11-11 23:56:09,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:56:09,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:56:09,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:56:09,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:56:09,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,825 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-11 23:56:09,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:56:09,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:56:09,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:56:09,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:56:09,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (1/1) ... [2024-11-11 23:56:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:56:09,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:56:09,894 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-11 23:56:09,895 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-11 23:56:09,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:56:09,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 23:56:09,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:56:09,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:56:10,011 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:56:10,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:56:10,481 INFO L? ?]: Removed 168 outVars from TransFormulas that were not future-live. [2024-11-11 23:56:10,482 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:56:10,492 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:56:10,492 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:56:10,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:10 BoogieIcfgContainer [2024-11-11 23:56:10,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:56:10,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:56:10,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:56:10,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:56:10,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:56:09" (1/3) ... [2024-11-11 23:56:10,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f708106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:56:10, skipping insertion in model container [2024-11-11 23:56:10,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:09" (2/3) ... [2024-11-11 23:56:10,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f708106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:56:10, skipping insertion in model container [2024-11-11 23:56:10,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:10" (3/3) ... [2024-11-11 23:56:10,501 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v2.c [2024-11-11 23:56:10,514 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:56:10,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:56:10,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:56:10,564 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;@2de2776f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:56:10,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:56:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 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-11 23:56:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 23:56:10,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:10,575 INFO L218 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] [2024-11-11 23:56:10,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:10,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1381663579, now seen corresponding path program 1 times [2024-11-11 23:56:10,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:56:10,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836889498] [2024-11-11 23:56:10,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:56:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:56:11,049 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-11 23:56:11,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:56:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836889498] [2024-11-11 23:56:11,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836889498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:56:11,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:56:11,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:56:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657690472] [2024-11-11 23:56:11,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:56:11,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:56:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:56:11,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:56:11,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:56:11,075 INFO L87 Difference]: Start difference. First operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 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 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-11 23:56:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:11,110 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2024-11-11 23:56:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:56:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2024-11-11 23:56:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:11,118 INFO L225 Difference]: With dead ends: 137 [2024-11-11 23:56:11,118 INFO L226 Difference]: Without dead ends: 93 [2024-11-11 23:56:11,120 INFO L434 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-11 23:56:11,123 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:11,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:56:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-11 23:56:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-11 23:56:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 92 states have internal predecessors, (135), 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-11 23:56:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-11 23:56:11,153 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 39 [2024-11-11 23:56:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:11,153 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-11 23:56:11,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-11 23:56:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-11 23:56:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-11 23:56:11,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:11,155 INFO L218 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-11 23:56:11,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 23:56:11,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:11,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -116406637, now seen corresponding path program 1 times [2024-11-11 23:56:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:56:11,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433082286] [2024-11-11 23:56:11,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:11,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:56:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:56:11,281 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-11 23:56:11,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:56:11,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433082286] [2024-11-11 23:56:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433082286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:56:11,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:56:11,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:56:11,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403559775] [2024-11-11 23:56:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:56:11,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:56:11,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:56:11,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:56:11,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:56:11,285 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. 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-11 23:56:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:11,312 INFO L93 Difference]: Finished difference Result 138 states and 199 transitions. [2024-11-11 23:56:11,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:56:11,313 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-11 23:56:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:11,314 INFO L225 Difference]: With dead ends: 138 [2024-11-11 23:56:11,314 INFO L226 Difference]: Without dead ends: 95 [2024-11-11 23:56:11,314 INFO L434 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-11 23:56:11,315 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:11,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:56:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-11 23:56:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-11 23:56:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 94 states have internal predecessors, (137), 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-11 23:56:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-11 23:56:11,320 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 40 [2024-11-11 23:56:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:11,321 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-11 23:56:11,321 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-11 23:56:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-11 23:56:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 23:56:11,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:11,322 INFO L218 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-11 23:56:11,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 23:56:11,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:11,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash -411604172, now seen corresponding path program 1 times [2024-11-11 23:56:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:56:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841042417] [2024-11-11 23:56:11,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:56:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:56:11,529 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-11 23:56:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:56:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841042417] [2024-11-11 23:56:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841042417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:56:11,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:56:11,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:56:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4378456] [2024-11-11 23:56:11,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:56:11,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:56:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:56:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:56:11,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:56:11,531 INFO L87 Difference]: Start difference. First operand 95 states and 137 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-11 23:56:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:11,582 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions. [2024-11-11 23:56:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:56:11,583 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-11 23:56:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:11,584 INFO L225 Difference]: With dead ends: 138 [2024-11-11 23:56:11,584 INFO L226 Difference]: Without dead ends: 93 [2024-11-11 23:56:11,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:56:11,585 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 100 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:11,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 249 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:56:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-11 23:56:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-11 23:56:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 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-11 23:56:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-11 23:56:11,593 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 41 [2024-11-11 23:56:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:11,593 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-11 23:56:11,593 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-11 23:56:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-11 23:56:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 23:56:11,594 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:11,594 INFO L218 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-11 23:56:11,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 23:56:11,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:11,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:11,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1689717878, now seen corresponding path program 1 times [2024-11-11 23:56:11,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:56:11,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296440276] [2024-11-11 23:56:11,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:56:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 23:56:11,628 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 23:56:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 23:56:11,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 23:56:11,687 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 23:56:11,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 23:56:11,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 23:56:11,693 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-11 23:56:11,726 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 23:56:11,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:56:11 BoogieIcfgContainer [2024-11-11 23:56:11,730 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 23:56:11,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 23:56:11,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 23:56:11,730 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 23:56:11,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:10" (3/4) ... [2024-11-11 23:56:11,733 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 23:56:11,734 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 23:56:11,735 INFO L158 Benchmark]: Toolchain (without parser) took 2313.35ms. Allocated memory was 176.2MB in the beginning and 283.1MB in the end (delta: 107.0MB). Free memory was 118.5MB in the beginning and 211.9MB in the end (delta: -93.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-11 23:56:11,736 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 23:56:11,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.35ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 100.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 23:56:11,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.64ms. Allocated memory is still 176.2MB. Free memory was 100.2MB in the beginning and 91.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 23:56:11,738 INFO L158 Benchmark]: Boogie Preprocessor took 79.58ms. Allocated memory is still 176.2MB. Free memory was 91.2MB in the beginning and 84.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-11 23:56:11,739 INFO L158 Benchmark]: RCFGBuilder took 625.72ms. Allocated memory was 176.2MB in the beginning and 283.1MB in the end (delta: 107.0MB). Free memory was 84.9MB in the beginning and 220.2MB in the end (delta: -135.3MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2024-11-11 23:56:11,739 INFO L158 Benchmark]: TraceAbstraction took 1233.70ms. Allocated memory is still 283.1MB. Free memory was 220.2MB in the beginning and 211.9MB in the end (delta: 8.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-11 23:56:11,739 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 283.1MB. Free memory is still 211.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 23:56:11,740 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.15ms. Allocated memory is still 176.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.35ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 100.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.64ms. Allocated memory is still 176.2MB. Free memory was 100.2MB in the beginning and 91.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.58ms. Allocated memory is still 176.2MB. Free memory was 91.2MB in the beginning and 84.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 625.72ms. Allocated memory was 176.2MB in the beginning and 283.1MB in the end (delta: 107.0MB). Free memory was 84.9MB in the beginning and 220.2MB in the end (delta: -135.3MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1233.70ms. Allocated memory is still 283.1MB. Free memory was 220.2MB in the beginning and 211.9MB in the end (delta: 8.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 283.1MB. Free memory is still 211.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 98. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_1 var_9 = 0; [L30] const SORT_1 var_17 = 1; [L32] SORT_1 input_2; [L33] SORT_1 input_3; [L34] SORT_1 input_4; [L35] SORT_1 input_5; [L36] SORT_1 input_6; [L37] SORT_1 input_7; [L38] SORT_1 input_8; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L40] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L41] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L42] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L42] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L43] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L44] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L45] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L46] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L47] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L48] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L49] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L50] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_17=1, var_9=0] [L51] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] SORT_1 init_11_arg_1 = var_9; [L54] state_10 = init_11_arg_1 [L55] SORT_1 init_13_arg_1 = var_9; [L56] state_12 = init_13_arg_1 [L57] SORT_1 init_22_arg_1 = var_9; [L58] state_21 = init_22_arg_1 [L59] SORT_1 init_24_arg_1 = var_9; [L60] state_23 = init_24_arg_1 [L61] SORT_1 init_26_arg_1 = var_9; [L62] state_25 = init_26_arg_1 [L63] SORT_1 init_28_arg_1 = var_9; [L64] state_27 = init_28_arg_1 [L65] SORT_1 init_30_arg_1 = var_9; [L66] state_29 = init_30_arg_1 [L67] SORT_1 init_32_arg_1 = var_9; [L68] state_31 = init_32_arg_1 [L69] SORT_1 init_34_arg_1 = var_9; [L70] state_33 = init_34_arg_1 [L71] SORT_1 init_36_arg_1 = var_9; [L72] state_35 = init_36_arg_1 [L73] SORT_1 init_39_arg_1 = var_9; [L74] state_38 = init_39_arg_1 [L75] SORT_1 init_41_arg_1 = var_9; [L76] state_40 = init_41_arg_1 VAL [mask_SORT_1=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_38=0, state_40=0, var_17=1, var_9=0] [L79] input_2 = __VERIFIER_nondet_uchar() [L80] input_3 = __VERIFIER_nondet_uchar() [L81] input_4 = __VERIFIER_nondet_uchar() [L82] input_5 = __VERIFIER_nondet_uchar() [L83] input_6 = __VERIFIER_nondet_uchar() [L84] EXPR input_6 & mask_SORT_1 VAL [mask_SORT_1=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_38=0, state_40=0, var_17=1, var_9=0] [L84] input_6 = input_6 & mask_SORT_1 [L85] input_7 = __VERIFIER_nondet_uchar() [L86] EXPR input_7 & mask_SORT_1 VAL [input_6=0, mask_SORT_1=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_38=0, state_40=0, var_17=1, var_9=0] [L86] input_7 = input_7 & mask_SORT_1 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] EXPR input_8 & mask_SORT_1 VAL [input_6=0, input_7=0, mask_SORT_1=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_38=0, state_40=0, var_17=1, var_9=0] [L88] input_8 = input_8 & mask_SORT_1 [L91] SORT_1 var_14_arg_0 = state_10; [L92] SORT_1 var_14_arg_1 = state_12; [L93] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L94] SORT_1 var_18_arg_0 = var_14; [L95] SORT_1 var_18 = ~var_18_arg_0; [L96] SORT_1 var_19_arg_0 = var_17; [L97] SORT_1 var_19_arg_1 = var_18; VAL [input_6=0, input_7=0, input_8=0, mask_SORT_1=1, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_38=0, state_40=0, var_17=1, var_19_arg_0=1, var_19_arg_1=-2, var_9=0] [L98] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_6=0, input_7=0, input_8=0, mask_SORT_1=1, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_38=0, state_40=0, var_17=1, var_9=0] [L98] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L99] EXPR var_19 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, mask_SORT_1=1, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_38=0, state_40=0, var_17=1, var_9=0] [L99] var_19 = var_19 & mask_SORT_1 [L100] SORT_1 bad_20_arg_0 = var_19; [L101] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 1019 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 632 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 387 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-11 23:56:11,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v2.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 c9d109b493cd6a4f14cdfea06aadcc172a16a2368d784cf5cde1e78a2b0f69e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:56:13,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:56:13,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-11 23:56:13,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:56:13,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:56:13,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:56:13,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:56:13,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:56:13,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:56:13,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:56:13,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:56:13,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:56:13,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:56:13,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:56:13,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:56:13,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:56:13,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:56:13,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:56:13,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:56:13,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:56:13,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:56:13,627 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 23:56:13,627 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 23:56:13,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:56:13,627 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 23:56:13,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:56:13,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:56:13,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:56:13,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:56:13,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:56:13,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:56:13,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:56:13,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:56:13,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:56:13,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:56:13,630 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 23:56:13,630 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 23:56:13,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:56:13,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:56:13,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:56:13,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:56:13,631 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 -> c9d109b493cd6a4f14cdfea06aadcc172a16a2368d784cf5cde1e78a2b0f69e6 [2024-11-11 23:56:13,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:56:13,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:56:13,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:56:13,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:56:13,897 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:56:13,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v2.c [2024-11-11 23:56:15,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:56:15,217 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-11 23:56:15,347 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:56:15,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v2.c [2024-11-11 23:56:15,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a7e9d6f/b8f2d36da8044b7f8504e5e73553d5a8/FLAGf102950cd [2024-11-11 23:56:15,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a7e9d6f/b8f2d36da8044b7f8504e5e73553d5a8 [2024-11-11 23:56:15,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:56:15,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:56:15,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:56:15,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:56:15,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:56:15,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c688d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15, skipping insertion in model container [2024-11-11 23:56:15,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:56:15,540 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.eq_sdp_v2.c[1249,1262] [2024-11-11 23:56:15,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:56:15,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:56:15,645 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.eq_sdp_v2.c[1249,1262] [2024-11-11 23:56:15,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:56:15,703 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:56:15,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15 WrapperNode [2024-11-11 23:56:15,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:56:15,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:56:15,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:56:15,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:56:15,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,753 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 247 [2024-11-11 23:56:15,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:56:15,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:56:15,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:56:15,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:56:15,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,795 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-11 23:56:15,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:56:15,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:56:15,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:56:15,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:56:15,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (1/1) ... [2024-11-11 23:56:15,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:56:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:56:15,844 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-11 23:56:15,847 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-11 23:56:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:56:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 23:56:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:56:15,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:56:15,958 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:56:15,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:56:16,190 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-11 23:56:16,190 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:56:16,204 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:56:16,205 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:56:16,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:16 BoogieIcfgContainer [2024-11-11 23:56:16,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:56:16,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:56:16,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:56:16,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:56:16,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:56:15" (1/3) ... [2024-11-11 23:56:16,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acbca8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:56:16, skipping insertion in model container [2024-11-11 23:56:16,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:15" (2/3) ... [2024-11-11 23:56:16,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acbca8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:56:16, skipping insertion in model container [2024-11-11 23:56:16,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:16" (3/3) ... [2024-11-11 23:56:16,213 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v2.c [2024-11-11 23:56:16,227 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:56:16,227 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:56:16,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:56:16,276 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;@31b7efc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:56:16,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:56:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-11 23:56:16,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:16,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-11 23:56:16,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:16,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-11 23:56:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:56:16,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020766430] [2024-11-11 23:56:16,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:16,297 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-11 23:56:16,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:56:16,298 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-11 23:56:16,299 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-11 23:56:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:56:16,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 23:56:16,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:56:16,571 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-11 23:56:16,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 23:56:16,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 23:56:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020766430] [2024-11-11 23:56:16,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020766430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:56:16,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:56:16,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:56:16,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041375507] [2024-11-11 23:56:16,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:56:16,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:56:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 23:56:16,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:56:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:56:16,603 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:16,629 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-11 23:56:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:56:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-11 23:56:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:16,637 INFO L225 Difference]: With dead ends: 17 [2024-11-11 23:56:16,637 INFO L226 Difference]: Without dead ends: 9 [2024-11-11 23:56:16,639 INFO L434 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-11 23:56:16,641 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:16,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:56:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-11 23:56:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-11 23:56:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-11 23:56:16,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-11 23:56:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:16,663 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-11 23:56:16,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-11 23:56:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 23:56:16,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:16,663 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-11 23:56:16,667 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-11 23:56:16,865 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-11 23:56:16,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:16,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-11 23:56:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:56:16,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344508610] [2024-11-11 23:56:16,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:16,868 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-11 23:56:16,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:56:16,871 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-11 23:56:16,872 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-11 23:56:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:56:16,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 23:56:16,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:56:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:17,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 23:56:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:17,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 23:56:17,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344508610] [2024-11-11 23:56:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344508610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 23:56:17,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 23:56:17,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-11 23:56:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45577573] [2024-11-11 23:56:17,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 23:56:17,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 23:56:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 23:56:17,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 23:56:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:56:17,498 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:17,581 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-11 23:56:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 23:56:17,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 23:56:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:17,582 INFO L225 Difference]: With dead ends: 14 [2024-11-11 23:56:17,583 INFO L226 Difference]: Without dead ends: 12 [2024-11-11 23:56:17,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:56:17,584 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:17,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:56:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-11 23:56:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-11 23:56:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-11 23:56:17,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-11 23:56:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:17,589 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-11 23:56:17,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-11 23:56:17,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 23:56:17,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:17,590 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-11 23:56:17,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-11 23:56:17,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 23:56:17,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:17,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-11 23:56:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:56:17,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641840627] [2024-11-11 23:56:17,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 23:56:17,793 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-11 23:56:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:56:17,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 23:56:17,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-11 23:56:17,887 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 23:56:17,887 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 23:56:17,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-11 23:56:17,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:56:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:18,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 23:56:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:19,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 23:56:19,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641840627] [2024-11-11 23:56:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641840627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 23:56:19,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 23:56:19,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-11 23:56:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270991889] [2024-11-11 23:56:19,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 23:56:19,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 23:56:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 23:56:19,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 23:56:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:56:19,608 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:20,783 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-11 23:56:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 23:56:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-11 23:56:20,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:20,785 INFO L225 Difference]: With dead ends: 14 [2024-11-11 23:56:20,785 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 23:56:20,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-11 23:56:20,788 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:20,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:56:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 23:56:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 23:56:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-11 23:56:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 23:56:20,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-11-11 23:56:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:20,791 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 23:56:20,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 23:56:20,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 23:56:20,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 23:56:20,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-11 23:56:20,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 23:56:21,000 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-11 23:56:21,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 23:56:21,388 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 23:56:21,398 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 23:56:21,399 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-11 23:56:21,400 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-11 23:56:21,401 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-11 23:56:21,401 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-11 23:56:21,401 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-11 23:56:21,401 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 23:56:21,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:56:21 BoogieIcfgContainer [2024-11-11 23:56:21,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 23:56:21,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 23:56:21,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 23:56:21,406 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 23:56:21,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:16" (3/4) ... [2024-11-11 23:56:21,408 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 23:56:21,417 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 23:56:21,418 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 23:56:21,418 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 23:56:21,418 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 23:56:21,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 23:56:21,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 23:56:21,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 23:56:21,493 INFO L158 Benchmark]: Toolchain (without parser) took 6124.43ms. Allocated memory was 90.2MB in the beginning and 207.6MB in the end (delta: 117.4MB). Free memory was 54.1MB in the beginning and 149.3MB in the end (delta: -95.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-11 23:56:21,493 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory was 31.5MB in the beginning and 31.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 23:56:21,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.84ms. Allocated memory is still 90.2MB. Free memory was 53.9MB in the beginning and 64.1MB in the end (delta: -10.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-11 23:56:21,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.08ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 61.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 23:56:21,494 INFO L158 Benchmark]: Boogie Preprocessor took 58.90ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 57.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 23:56:21,494 INFO L158 Benchmark]: RCFGBuilder took 389.12ms. Allocated memory is still 90.2MB. Free memory was 57.9MB in the beginning and 61.5MB in the end (delta: -3.6MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-11 23:56:21,494 INFO L158 Benchmark]: TraceAbstraction took 5195.53ms. Allocated memory was 90.2MB in the beginning and 207.6MB in the end (delta: 117.4MB). Free memory was 61.1MB in the beginning and 155.6MB in the end (delta: -94.5MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2024-11-11 23:56:21,495 INFO L158 Benchmark]: Witness Printer took 87.34ms. Allocated memory is still 207.6MB. Free memory was 155.6MB in the beginning and 149.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-11 23:56:21,496 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.15ms. Allocated memory is still 54.5MB. Free memory was 31.5MB in the beginning and 31.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.84ms. Allocated memory is still 90.2MB. Free memory was 53.9MB in the beginning and 64.1MB in the end (delta: -10.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.08ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 61.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.90ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 57.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.12ms. Allocated memory is still 90.2MB. Free memory was 57.9MB in the beginning and 61.5MB in the end (delta: -3.6MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5195.53ms. Allocated memory was 90.2MB in the beginning and 207.6MB in the end (delta: 117.4MB). Free memory was 61.1MB in the beginning and 155.6MB in the end (delta: -94.5MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. * Witness Printer took 87.34ms. Allocated memory is still 207.6MB. Free memory was 155.6MB in the beginning and 149.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 11 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 14 QuantifiedInterpolants, 3017 SizeOfPredicates, 13 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-11 23:56:21,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE