./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.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 a995c16e34c6a8c947423a8daf73fb5637408e6de846a052a4473f47c82db47d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:05:33,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:05:33,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:05:33,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:05:33,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:05:33,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:05:33,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:05:33,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:05:33,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:05:33,637 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:05:33,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:05:33,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:05:33,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:05:33,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:05:33,640 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:05:33,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:05:33,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:05:33,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:05:33,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:05:33,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:05:33,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:05:33,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:05:33,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:05:33,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:05:33,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:05:33,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:05:33,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:05:33,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:05:33,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:05:33,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:05:33,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:05:33,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:05:33,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:05:33,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:05:33,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:05:33,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:05:33,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:05:33,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:05:33,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:05:33,649 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 -> a995c16e34c6a8c947423a8daf73fb5637408e6de846a052a4473f47c82db47d [2024-11-08 19:05:33,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:05:33,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:05:33,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:05:33,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:05:33,921 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:05:33,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2024-11-08 19:05:35,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:05:35,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:05:35,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2024-11-08 19:05:35,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90303d5ce/2fda76c676eb4cdf8902905cfc09d077/FLAGae848ac9f [2024-11-08 19:05:35,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90303d5ce/2fda76c676eb4cdf8902905cfc09d077 [2024-11-08 19:05:35,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:05:35,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:05:35,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:05:35,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:05:35,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:05:35,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:35,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a31bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35, skipping insertion in model container [2024-11-08 19:05:35,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:35,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:05:35,825 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.swap_three.c[1250,1263] [2024-11-08 19:05:35,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:35,889 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:05:35,900 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.swap_three.c[1250,1263] [2024-11-08 19:05:35,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:35,947 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:05:35,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35 WrapperNode [2024-11-08 19:05:35,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:05:35,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:35,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:05:35,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:05:35,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:35,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,015 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 173 [2024-11-08 19:05:36,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:36,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:05:36,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:05:36,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:05:36,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,058 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:05:36,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:05:36,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:05:36,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:05:36,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:05:36,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (1/1) ... [2024-11-08 19:05:36,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:05:36,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:05:36,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:05:36,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:05:36,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:05:36,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:05:36,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:05:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:05:36,284 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:05:36,287 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:05:36,676 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-11-08 19:05:36,677 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:05:36,691 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:05:36,692 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:05:36,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:36 BoogieIcfgContainer [2024-11-08 19:05:36,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:05:36,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:05:36,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:05:36,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:05:36,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:05:35" (1/3) ... [2024-11-08 19:05:36,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473563ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:36, skipping insertion in model container [2024-11-08 19:05:36,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:35" (2/3) ... [2024-11-08 19:05:36,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473563ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:36, skipping insertion in model container [2024-11-08 19:05:36,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:36" (3/3) ... [2024-11-08 19:05:36,705 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.swap_three.c [2024-11-08 19:05:36,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:05:36,723 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:05:36,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:05:36,794 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;@996506d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:05:36,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:05:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 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-08 19:05:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:05:36,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:36,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:36,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:36,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash 356048692, now seen corresponding path program 1 times [2024-11-08 19:05:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868852668] [2024-11-08 19:05:36,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:37,466 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-08 19:05:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868852668] [2024-11-08 19:05:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868852668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:37,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:37,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:05:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762177183] [2024-11-08 19:05:37,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:37,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:05:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:37,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:05:37,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:05:37,506 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:37,552 INFO L93 Difference]: Finished difference Result 85 states and 123 transitions. [2024-11-08 19:05:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:05:37,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-08 19:05:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:37,562 INFO L225 Difference]: With dead ends: 85 [2024-11-08 19:05:37,562 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 19:05:37,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:05:37,567 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 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-08 19:05:37,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:05:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 19:05:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 19:05:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 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-08 19:05:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-11-08 19:05:37,597 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 25 [2024-11-08 19:05:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:37,597 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-11-08 19:05:37,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-11-08 19:05:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:05:37,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:37,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:37,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:05:37,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:37,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:37,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1845697153, now seen corresponding path program 1 times [2024-11-08 19:05:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083796340] [2024-11-08 19:05:37,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:37,799 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-08 19:05:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:37,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083796340] [2024-11-08 19:05:37,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083796340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:37,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:37,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:05:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45539865] [2024-11-08 19:05:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:37,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:05:37,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:37,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:05:37,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:05:37,806 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:37,842 INFO L93 Difference]: Finished difference Result 86 states and 121 transitions. [2024-11-08 19:05:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:05:37,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-08 19:05:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:37,844 INFO L225 Difference]: With dead ends: 86 [2024-11-08 19:05:37,844 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 19:05:37,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:05:37,846 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 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-08 19:05:37,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:05:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 19:05:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 19:05:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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-08 19:05:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-08 19:05:37,856 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 26 [2024-11-08 19:05:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:37,856 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-08 19:05:37,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-08 19:05:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:05:37,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:37,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:37,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:05:37,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:37,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1814964589, now seen corresponding path program 1 times [2024-11-08 19:05:37,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:37,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479739722] [2024-11-08 19:05:37,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:37,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:38,136 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-08 19:05:38,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:38,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479739722] [2024-11-08 19:05:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479739722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:38,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:05:38,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029885235] [2024-11-08 19:05:38,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:38,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:05:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:38,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:05:38,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:05:38,144 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:38,312 INFO L93 Difference]: Finished difference Result 125 states and 173 transitions. [2024-11-08 19:05:38,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:05:38,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 19:05:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:38,315 INFO L225 Difference]: With dead ends: 125 [2024-11-08 19:05:38,315 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 19:05:38,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:38,320 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 58 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:38,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 125 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 19:05:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 54. [2024-11-08 19:05:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 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-08 19:05:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2024-11-08 19:05:38,332 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 27 [2024-11-08 19:05:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:38,332 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2024-11-08 19:05:38,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2024-11-08 19:05:38,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:05:38,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:38,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:38,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:05:38,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:38,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1301893526, now seen corresponding path program 1 times [2024-11-08 19:05:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:38,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001630914] [2024-11-08 19:05:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:38,525 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-08 19:05:38,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:38,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001630914] [2024-11-08 19:05:38,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001630914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:38,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:38,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:05:38,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284534981] [2024-11-08 19:05:38,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:38,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:05:38,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:05:38,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:38,529 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:38,639 INFO L93 Difference]: Finished difference Result 125 states and 171 transitions. [2024-11-08 19:05:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:05:38,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 19:05:38,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:38,641 INFO L225 Difference]: With dead ends: 125 [2024-11-08 19:05:38,642 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 19:05:38,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:05:38,645 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 92 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:38,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 176 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 19:05:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2024-11-08 19:05:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 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-08 19:05:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2024-11-08 19:05:38,657 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 29 [2024-11-08 19:05:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:38,658 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2024-11-08 19:05:38,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2024-11-08 19:05:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:05:38,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:38,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:38,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:05:38,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1668918654, now seen corresponding path program 1 times [2024-11-08 19:05:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190462386] [2024-11-08 19:05:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:38,818 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-08 19:05:38,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:38,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190462386] [2024-11-08 19:05:38,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190462386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:38,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:38,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:05:38,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479763178] [2024-11-08 19:05:38,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:38,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:05:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:05:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:38,822 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:38,901 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2024-11-08 19:05:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:05:38,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-08 19:05:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:38,902 INFO L225 Difference]: With dead ends: 125 [2024-11-08 19:05:38,903 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 19:05:38,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:05:38,904 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 80 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:38,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 178 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 19:05:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2024-11-08 19:05:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 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-08 19:05:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2024-11-08 19:05:38,910 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 30 [2024-11-08 19:05:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:38,911 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2024-11-08 19:05:38,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2024-11-08 19:05:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:05:38,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:38,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:38,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:05:38,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:38,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:38,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1250927772, now seen corresponding path program 1 times [2024-11-08 19:05:38,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:38,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256508154] [2024-11-08 19:05:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:38,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:39,099 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-08 19:05:39,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:39,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256508154] [2024-11-08 19:05:39,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256508154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:39,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:39,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:05:39,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818358926] [2024-11-08 19:05:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:39,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:05:39,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:39,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:05:39,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:05:39,103 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:39,228 INFO L93 Difference]: Finished difference Result 131 states and 177 transitions. [2024-11-08 19:05:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:05:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-08 19:05:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:39,229 INFO L225 Difference]: With dead ends: 131 [2024-11-08 19:05:39,229 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 19:05:39,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:39,232 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 50 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:39,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 128 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 19:05:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2024-11-08 19:05:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 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-08 19:05:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2024-11-08 19:05:39,242 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 31 [2024-11-08 19:05:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:39,242 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2024-11-08 19:05:39,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2024-11-08 19:05:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:05:39,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:39,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:39,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:05:39,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:39,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash -186857293, now seen corresponding path program 1 times [2024-11-08 19:05:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:39,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901479180] [2024-11-08 19:05:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:05:39,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:39,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901479180] [2024-11-08 19:05:39,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901479180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:39,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:39,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:05:39,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116123383] [2024-11-08 19:05:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:39,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:05:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:05:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:05:39,395 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-08 19:05:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:39,503 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2024-11-08 19:05:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:05:39,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2024-11-08 19:05:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:39,505 INFO L225 Difference]: With dead ends: 125 [2024-11-08 19:05:39,505 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 19:05:39,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:39,506 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 43 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:39,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 19:05:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2024-11-08 19:05:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 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-08 19:05:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2024-11-08 19:05:39,515 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 32 [2024-11-08 19:05:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:39,515 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2024-11-08 19:05:39,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-08 19:05:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-08 19:05:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 19:05:39,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:39,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:39,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:05:39,518 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash -56303580, now seen corresponding path program 1 times [2024-11-08 19:05:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184847059] [2024-11-08 19:05:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:39,883 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-08 19:05:39,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:05:39,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184847059] [2024-11-08 19:05:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184847059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:39,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:05:39,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542385168] [2024-11-08 19:05:39,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:39,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:05:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:05:39,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:05:39,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:05:39,887 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-08 19:05:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:39,935 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2024-11-08 19:05:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:05:39,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 33 [2024-11-08 19:05:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:39,937 INFO L225 Difference]: With dead ends: 107 [2024-11-08 19:05:39,937 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 19:05:39,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:05:39,938 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 48 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:39,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 224 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:05:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 19:05:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-11-08 19:05:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 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-08 19:05:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-08 19:05:39,941 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 33 [2024-11-08 19:05:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:39,942 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-08 19:05:39,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-08 19:05:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-08 19:05:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:05:39,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:39,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:39,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:05:39,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:39,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash -180865749, now seen corresponding path program 1 times [2024-11-08 19:05:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:05:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466098895] [2024-11-08 19:05:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:05:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:05:39,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:05:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:05:40,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:05:40,028 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:05:40,030 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:05:40,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:05:40,034 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:40,082 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:05:40,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:05:40 BoogieIcfgContainer [2024-11-08 19:05:40,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:05:40,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:05:40,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:05:40,088 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:05:40,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:36" (3/4) ... [2024-11-08 19:05:40,092 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:05:40,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:05:40,095 INFO L158 Benchmark]: Toolchain (without parser) took 4524.32ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 105.9MB in the beginning and 158.9MB in the end (delta: -53.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:05:40,095 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:05:40,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.50ms. Allocated memory is still 176.2MB. Free memory was 105.7MB in the beginning and 141.6MB in the end (delta: -35.8MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-08 19:05:40,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.20ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 138.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:05:40,096 INFO L158 Benchmark]: Boogie Preprocessor took 61.22ms. Allocated memory is still 176.2MB. Free memory was 138.2MB in the beginning and 135.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:05:40,096 INFO L158 Benchmark]: RCFGBuilder took 614.97ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 112.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 19:05:40,096 INFO L158 Benchmark]: TraceAbstraction took 3390.70ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 112.2MB in the beginning and 158.9MB in the end (delta: -46.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-11-08 19:05:40,097 INFO L158 Benchmark]: Witness Printer took 6.40ms. Allocated memory is still 226.5MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:05:40,098 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.21ms. Allocated memory is still 176.2MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.50ms. Allocated memory is still 176.2MB. Free memory was 105.7MB in the beginning and 141.6MB in the end (delta: -35.8MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.20ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 138.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.22ms. Allocated memory is still 176.2MB. Free memory was 138.2MB in the beginning and 135.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 614.97ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 112.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3390.70ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 112.2MB in the beginning and 158.9MB in the end (delta: -46.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Witness Printer took 6.40ms. Allocated memory is still 226.5MB. Free memory is still 158.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 90. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 20); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (20 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_8 var_10 = 1; [L37] const SORT_8 var_13 = 5; [L38] const SORT_8 var_17 = 7; [L39] const SORT_1 var_22 = 1; [L40] const SORT_4 var_26 = 5; [L41] const SORT_4 var_29 = 7; [L43] SORT_1 input_2; [L44] SORT_1 input_3; [L46] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L46] SORT_4 state_6 = __VERIFIER_nondet_uint() & mask_SORT_4; [L47] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L47] SORT_4 state_27 = __VERIFIER_nondet_uint() & mask_SORT_4; [L48] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L48] SORT_4 state_30 = __VERIFIER_nondet_uint() & mask_SORT_4; [L50] SORT_4 init_7_arg_1 = var_5; [L51] state_6 = init_7_arg_1 [L52] SORT_4 init_28_arg_1 = var_26; [L53] state_27 = init_28_arg_1 [L54] SORT_4 init_31_arg_1 = var_29; [L55] state_30 = init_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_9_arg_0 = state_6; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1, var_9_arg_0=1] [L63] EXPR var_9_arg_0 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L63] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L64] SORT_8 var_9 = var_9_arg_0; [L65] SORT_8 var_11_arg_0 = var_9; [L66] SORT_8 var_11_arg_1 = var_10; [L67] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L68] SORT_4 var_12_arg_0 = state_6; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_12_arg_0=1, var_13=5, var_17=7, var_22=1] [L69] EXPR var_12_arg_0 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_13=5, var_17=7, var_22=1] [L69] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L70] SORT_8 var_12 = var_12_arg_0; [L71] SORT_8 var_14_arg_0 = var_12; [L72] SORT_8 var_14_arg_1 = var_13; [L73] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L74] SORT_1 var_15_arg_0 = var_11; [L75] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_15_arg_0=0, var_15_arg_1=0, var_17=7, var_22=1] [L76] EXPR var_15_arg_0 | var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L76] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L77] SORT_4 var_16_arg_0 = state_6; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_15=0, var_16_arg_0=1, var_17=7, var_22=1] [L78] EXPR var_16_arg_0 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_15=0, var_17=7, var_22=1] [L78] var_16_arg_0 = var_16_arg_0 & mask_SORT_4 [L79] SORT_8 var_16 = var_16_arg_0; [L80] SORT_8 var_18_arg_0 = var_16; [L81] SORT_8 var_18_arg_1 = var_17; [L82] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L83] SORT_1 var_19_arg_0 = var_15; [L84] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_19_arg_0=0, var_19_arg_1=0, var_22=1] [L85] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L85] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L86] SORT_1 var_23_arg_0 = var_19; [L87] SORT_1 var_23 = ~var_23_arg_0; [L88] SORT_1 var_24_arg_0 = var_22; [L89] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1, var_24_arg_0=1, var_24_arg_1=-1] [L90] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L90] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L91] EXPR var_24 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L91] var_24 = var_24 & mask_SORT_1 [L92] SORT_1 bad_25_arg_0 = var_24; [L93] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 371 mSDsluCounter, 1334 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 934 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 400 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 134 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-08 19:05:40,130 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.swap_three.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 a995c16e34c6a8c947423a8daf73fb5637408e6de846a052a4473f47c82db47d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:05:42,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:05:42,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 19:05:42,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:05:42,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:05:42,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:05:42,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:05:42,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:05:42,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:05:42,505 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:05:42,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:05:42,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:05:42,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:05:42,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:05:42,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:05:42,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:05:42,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:05:42,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:05:42,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:05:42,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:05:42,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:05:42,513 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:05:42,514 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:05:42,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:05:42,514 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:05:42,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:05:42,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:05:42,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:05:42,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:05:42,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:05:42,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:05:42,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:05:42,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:05:42,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:05:42,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:05:42,530 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:05:42,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:05:42,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:05:42,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:05:42,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:05:42,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:05:42,533 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 -> a995c16e34c6a8c947423a8daf73fb5637408e6de846a052a4473f47c82db47d [2024-11-08 19:05:42,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:05:42,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:05:42,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:05:42,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:05:42,871 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:05:42,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2024-11-08 19:05:44,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:05:44,640 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:05:44,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2024-11-08 19:05:44,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9430986/392323f8ea174b6f96fbf1ac2802a279/FLAG73ca2cbc9 [2024-11-08 19:05:45,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9430986/392323f8ea174b6f96fbf1ac2802a279 [2024-11-08 19:05:45,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:05:45,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:05:45,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:05:45,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:05:45,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:05:45,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bba393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45, skipping insertion in model container [2024-11-08 19:05:45,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:05:45,225 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.swap_three.c[1250,1263] [2024-11-08 19:05:45,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:45,285 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:05:45,298 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.swap_three.c[1250,1263] [2024-11-08 19:05:45,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:05:45,344 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:05:45,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45 WrapperNode [2024-11-08 19:05:45,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:05:45,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:45,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:05:45,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:05:45,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,387 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2024-11-08 19:05:45,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:05:45,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:05:45,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:05:45,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:05:45,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,425 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:05:45,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:05:45,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:05:45,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:05:45,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:05:45,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (1/1) ... [2024-11-08 19:05:45,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:05:45,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:05:45,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:05:45,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:05:45,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:05:45,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:05:45,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:05:45,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:05:45,641 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:05:45,645 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:05:45,852 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-08 19:05:45,853 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:05:45,864 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:05:45,865 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:05:45,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:45 BoogieIcfgContainer [2024-11-08 19:05:45,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:05:45,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:05:45,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:05:45,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:05:45,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:05:45" (1/3) ... [2024-11-08 19:05:45,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a3d81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:45, skipping insertion in model container [2024-11-08 19:05:45,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:05:45" (2/3) ... [2024-11-08 19:05:45,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a3d81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:05:45, skipping insertion in model container [2024-11-08 19:05:45,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:45" (3/3) ... [2024-11-08 19:05:45,875 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.swap_three.c [2024-11-08 19:05:45,892 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:05:45,893 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:05:45,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:05:45,956 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;@1a045524, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:05:45,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:05:45,959 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-08 19:05:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:05:45,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:45,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 19:05:45,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:45,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:45,970 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 19:05:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:05:45,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633844938] [2024-11-08 19:05:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:45,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:45,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:05:45,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:05:45,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:05:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:46,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 19:05:46,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:05:46,410 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-08 19:05:46,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:05:46,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:05:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633844938] [2024-11-08 19:05:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633844938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:05:46,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:05:46,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:05:46,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541237335] [2024-11-08 19:05:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:05:46,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:05:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:05:46,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:05:46,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:05:46,443 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-08 19:05:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:46,489 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 19:05:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:05:46,498 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-08 19:05:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:46,511 INFO L225 Difference]: With dead ends: 18 [2024-11-08 19:05:46,511 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 19:05:46,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:05:46,519 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:46,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:05:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 19:05:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 19:05:46,546 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-08 19:05:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 19:05:46,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 19:05:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:46,549 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 19:05:46,549 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-08 19:05:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 19:05:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:05:46,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:46,550 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:05:46,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:05:46,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:46,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:46,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 19:05:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:05:46,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884662800] [2024-11-08 19:05:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:05:46,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:46,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:05:46,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:05:46,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:05:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:05:46,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 19:05:46,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:05:47,027 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-08 19:05:47,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:05:47,327 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-08 19:05:47,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:05:47,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884662800] [2024-11-08 19:05:47,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884662800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:05:47,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:05:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 19:05:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979485910] [2024-11-08 19:05:47,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:05:47,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:05:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:05:47,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:05:47,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:05:47,332 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-08 19:05:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:47,393 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-08 19:05:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:05:47,394 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-08 19:05:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:47,394 INFO L225 Difference]: With dead ends: 15 [2024-11-08 19:05:47,394 INFO L226 Difference]: Without dead ends: 13 [2024-11-08 19:05:47,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:05:47,396 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:47,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:05:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-08 19:05:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-08 19:05:47,400 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-08 19:05:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-08 19:05:47,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-08 19:05:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:47,401 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-08 19:05:47,401 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-08 19:05:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-08 19:05:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:05:47,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:47,403 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-08 19:05:47,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 19:05:47,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:47,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:47,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-08 19:05:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:05:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501984152] [2024-11-08 19:05:47,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:05:47,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:47,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:05:47,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:05:47,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:05:47,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:05:47,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:05:47,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 19:05:47,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:05:47,902 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-08 19:05:47,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:05:48,167 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-08 19:05:48,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:05:48,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501984152] [2024-11-08 19:05:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501984152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:05:48,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:05:48,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-08 19:05:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467845153] [2024-11-08 19:05:48,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:05:48,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:05:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:05:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:05:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:05:48,170 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-08 19:05:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:48,253 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-08 19:05:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:05:48,254 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-08 19:05:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:48,255 INFO L225 Difference]: With dead ends: 22 [2024-11-08 19:05:48,255 INFO L226 Difference]: Without dead ends: 20 [2024-11-08 19:05:48,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:05:48,256 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:48,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-08 19:05:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-08 19:05:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-08 19:05:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-08 19:05:48,261 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 11 [2024-11-08 19:05:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:48,261 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-08 19:05:48,261 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-08 19:05:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-08 19:05:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:05:48,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:48,262 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-08 19:05:48,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 19:05:48,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:48,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:48,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:48,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-08 19:05:48,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:05:48,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373130629] [2024-11-08 19:05:48,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 19:05:48,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:48,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:05:48,471 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:05:48,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 19:05:48,596 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 19:05:48,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:05:48,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 19:05:48,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:05:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:05:48,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:05:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:05:49,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:05:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373130629] [2024-11-08 19:05:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373130629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:05:49,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:05:49,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-08 19:05:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345736819] [2024-11-08 19:05:49,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:05:49,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:05:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:05:49,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:05:49,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:05:49,158 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:49,264 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-08 19:05:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:05:49,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 19:05:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:49,266 INFO L225 Difference]: With dead ends: 20 [2024-11-08 19:05:49,266 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 19:05:49,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:05:49,269 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:49,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:05:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 19:05:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 19:05:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-08 19:05:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-08 19:05:49,277 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2024-11-08 19:05:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:49,277 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-08 19:05:49,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:05:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-08 19:05:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:05:49,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:05:49,278 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-08 19:05:49,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 19:05:49,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:49,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:05:49,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:05:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 4 times [2024-11-08 19:05:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:05:49,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788635440] [2024-11-08 19:05:49,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 19:05:49,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:49,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:05:49,483 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:05:49,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 19:05:49,616 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 19:05:49,616 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:05:49,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 19:05:49,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:05:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:05:50,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:05:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:05:51,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:05:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788635440] [2024-11-08 19:05:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788635440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:05:51,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:05:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-08 19:05:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772332005] [2024-11-08 19:05:51,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:05:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:05:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:05:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:05:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:05:51,040 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-08 19:05:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:05:51,292 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-08 19:05:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:05:51,292 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 17 [2024-11-08 19:05:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:05:51,293 INFO L225 Difference]: With dead ends: 18 [2024-11-08 19:05:51,293 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 19:05:51,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:05:51,294 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:05:51,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:05:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 19:05:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 19:05:51,296 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-08 19:05:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 19:05:51,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2024-11-08 19:05:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:05:51,296 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 19:05:51,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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-08 19:05:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 19:05:51,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:05:51,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:05:51,305 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 (6)] Forceful destruction successful, exit code 0 [2024-11-08 19:05:51,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:05:51,503 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-08 19:05:51,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 19:05:51,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:05:51,719 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-08 19:05:51,720 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-08 19:05:51,721 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-08 19:05:51,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:05:51 BoogieIcfgContainer [2024-11-08 19:05:51,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:05:51,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:05:51,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:05:51,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:05:51,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:05:45" (3/4) ... [2024-11-08 19:05:51,731 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:05:51,752 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 19:05:51,753 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 19:05:51,753 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 19:05:51,753 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 19:05:51,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 19:05:51,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 19:05:51,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:05:51,857 INFO L158 Benchmark]: Toolchain (without parser) took 6850.67ms. Allocated memory was 69.2MB in the beginning and 153.1MB in the end (delta: 83.9MB). Free memory was 34.9MB in the beginning and 124.5MB in the end (delta: -89.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:05:51,857 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 48.2MB. Free memory was 23.4MB in the beginning and 23.3MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:05:51,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.47ms. Allocated memory is still 69.2MB. Free memory was 34.7MB in the beginning and 38.1MB in the end (delta: -3.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-11-08 19:05:51,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.48ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 36.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:05:51,858 INFO L158 Benchmark]: Boogie Preprocessor took 56.01ms. Allocated memory is still 69.2MB. Free memory was 36.3MB in the beginning and 34.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:05:51,858 INFO L158 Benchmark]: RCFGBuilder took 418.81ms. Allocated memory is still 69.2MB. Free memory was 34.0MB in the beginning and 41.6MB in the end (delta: -7.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-08 19:05:51,858 INFO L158 Benchmark]: TraceAbstraction took 5859.66ms. Allocated memory was 69.2MB in the beginning and 153.1MB in the end (delta: 83.9MB). Free memory was 40.9MB in the beginning and 128.7MB in the end (delta: -87.8MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2024-11-08 19:05:51,858 INFO L158 Benchmark]: Witness Printer took 127.95ms. Allocated memory is still 153.1MB. Free memory was 128.7MB in the beginning and 124.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:05:51,861 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.11ms. Allocated memory is still 48.2MB. Free memory was 23.4MB in the beginning and 23.3MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.47ms. Allocated memory is still 69.2MB. Free memory was 34.7MB in the beginning and 38.1MB in the end (delta: -3.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.48ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 36.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.01ms. Allocated memory is still 69.2MB. Free memory was 36.3MB in the beginning and 34.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.81ms. Allocated memory is still 69.2MB. Free memory was 34.0MB in the beginning and 41.6MB in the end (delta: -7.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5859.66ms. Allocated memory was 69.2MB in the beginning and 153.1MB in the end (delta: 83.9MB). Free memory was 40.9MB in the beginning and 128.7MB in the end (delta: -87.8MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * Witness Printer took 127.95ms. Allocated memory is still 153.1MB. Free memory was 128.7MB in the beginning and 124.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 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 * 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: 5.6s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 25 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 55 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 96 ConstructedInterpolants, 21 QuantifiedInterpolants, 2979 SizeOfPredicates, 30 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 30/100 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: 56]: Loop Invariant Derived loop invariant: ((((((((7 == var_17) && (1 == state_27)) && (7 == state_6)) && (1 == mask_SORT_1)) && (1 == var_10)) && (1048575 == mask_SORT_4)) || ((((((7 == var_17) && (1 == state_6)) && (7 == state_30)) && (1 == mask_SORT_1)) && (1 == var_10)) && (1048575 == mask_SORT_4))) || ((((((7 == var_17) && (1 == state_30)) && (1 == mask_SORT_1)) && (1 == var_10)) && (1048575 == mask_SORT_4)) && (7 == state_27))) RESULT: Ultimate proved your program to be correct! [2024-11-08 19:05:51,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE