./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.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 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:39:19,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:39:19,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 05:39:19,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:39:19,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:39:19,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:39:19,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:39:19,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:39:19,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:39:19,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:39:19,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:39:19,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:39:19,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:39:19,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:39:19,706 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:39:19,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:39:19,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:39:19,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:39:19,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:39:19,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:39:19,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:39:19,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:39:19,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:39:19,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:39:19,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:39:19,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:39:19,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:39:19,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:39:19,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:39:19,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:39:19,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:39:19,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:39:19,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:39:19,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:39:19,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:39:19,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:39:19,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:39:19,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:39:19,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:39:19,717 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 -> 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a [2024-10-14 05:39:19,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:39:19,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:39:19,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:39:20,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:39:20,002 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:39:20,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2024-10-14 05:39:21,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:39:21,668 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:39:21,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2024-10-14 05:39:21,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928f9b80c/2fad0bb4a2654a358e7dc633ed8bd155/FLAG8d84ffcea [2024-10-14 05:39:21,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928f9b80c/2fad0bb4a2654a358e7dc633ed8bd155 [2024-10-14 05:39:21,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:39:21,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:39:21,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:39:21,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:39:21,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:39:21,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:39:21" (1/1) ... [2024-10-14 05:39:21,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e32f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:21, skipping insertion in model container [2024-10-14 05:39:21,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:39:21" (1/1) ... [2024-10-14 05:39:22,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:39:22,203 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c[1244,1257] [2024-10-14 05:39:22,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:39:22,433 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:39:22,447 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c[1244,1257] [2024-10-14 05:39:22,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:39:22,615 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:39:22,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22 WrapperNode [2024-10-14 05:39:22,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:39:22,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:39:22,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:39:22,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:39:22,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:22,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:22,805 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1798 [2024-10-14 05:39:22,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:39:22,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:39:22,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:39:22,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:39:22,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:22,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:22,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:22,990 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-14 05:39:22,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:22,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:23,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:23,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:23,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:23,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:23,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:39:23,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:39:23,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:39:23,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:39:23,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (1/1) ... [2024-10-14 05:39:23,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:39:23,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:39:23,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:39:23,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:39:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:39:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:39:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 05:39:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:39:23,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:39:23,470 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:39:23,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:39:25,043 INFO L? ?]: Removed 1027 outVars from TransFormulas that were not future-live. [2024-10-14 05:39:25,044 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:39:25,105 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:39:25,106 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 05:39:25,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:39:25 BoogieIcfgContainer [2024-10-14 05:39:25,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:39:25,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:39:25,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:39:25,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:39:25,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:39:21" (1/3) ... [2024-10-14 05:39:25,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fa9a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:39:25, skipping insertion in model container [2024-10-14 05:39:25,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:22" (2/3) ... [2024-10-14 05:39:25,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fa9a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:39:25, skipping insertion in model container [2024-10-14 05:39:25,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:39:25" (3/3) ... [2024-10-14 05:39:25,115 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal1.c [2024-10-14 05:39:25,135 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:39:25,135 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 05:39:25,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:39:25,226 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;@10027fe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:39:25,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 05:39:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 327 states, 325 states have (on average 1.5015384615384615) internal successors, (488), 326 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:39:25,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:39:25,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:39:25,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:39:25,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:39:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1407432287, now seen corresponding path program 1 times [2024-10-14 05:39:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:39:25,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417574705] [2024-10-14 05:39:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:39:25,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:39:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:39:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:39:26,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:39:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417574705] [2024-10-14 05:39:26,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417574705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:39:26,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:39:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:39:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060444751] [2024-10-14 05:39:26,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:39:26,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:39:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:39:26,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:39:26,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:39:26,213 INFO L87 Difference]: Start difference. First operand has 327 states, 325 states have (on average 1.5015384615384615) internal successors, (488), 326 states have internal predecessors, (488), 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 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:39:26,332 INFO L93 Difference]: Finished difference Result 534 states and 798 transitions. [2024-10-14 05:39:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:39:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2024-10-14 05:39:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:39:26,356 INFO L225 Difference]: With dead ends: 534 [2024-10-14 05:39:26,356 INFO L226 Difference]: Without dead ends: 328 [2024-10-14 05:39:26,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:39:26,366 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:39:26,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1444 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:39:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-14 05:39:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-10-14 05:39:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.492354740061162) internal successors, (488), 327 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 488 transitions. [2024-10-14 05:39:26,439 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 488 transitions. Word has length 78 [2024-10-14 05:39:26,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:39:26,440 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 488 transitions. [2024-10-14 05:39:26,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 488 transitions. [2024-10-14 05:39:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 05:39:26,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:39:26,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:39:26,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:39:26,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:39:26,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:39:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash -679032303, now seen corresponding path program 1 times [2024-10-14 05:39:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:39:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443975007] [2024-10-14 05:39:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:39:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:39:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:39:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:39:26,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:39:26,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443975007] [2024-10-14 05:39:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443975007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:39:26,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:39:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:39:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723002121] [2024-10-14 05:39:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:39:26,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:39:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:39:26,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:39:26,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:39:26,797 INFO L87 Difference]: Start difference. First operand 328 states and 488 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:39:26,849 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2024-10-14 05:39:26,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:39:26,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2024-10-14 05:39:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:39:26,853 INFO L225 Difference]: With dead ends: 537 [2024-10-14 05:39:26,855 INFO L226 Difference]: Without dead ends: 330 [2024-10-14 05:39:26,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:39:26,857 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:39:26,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:39:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-14 05:39:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2024-10-14 05:39:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 1.4893617021276595) internal successors, (490), 329 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 490 transitions. [2024-10-14 05:39:26,882 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 490 transitions. Word has length 79 [2024-10-14 05:39:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:39:26,883 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 490 transitions. [2024-10-14 05:39:26,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 490 transitions. [2024-10-14 05:39:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:39:26,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:39:26,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:39:26,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:39:26,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:39:26,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:39:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash -673130374, now seen corresponding path program 1 times [2024-10-14 05:39:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:39:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920089392] [2024-10-14 05:39:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:39:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:39:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:39:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:39:27,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:39:27,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920089392] [2024-10-14 05:39:27,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920089392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:39:27,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:39:27,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:39:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397101497] [2024-10-14 05:39:27,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:39:27,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:39:27,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:39:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:39:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:39:27,525 INFO L87 Difference]: Start difference. First operand 330 states and 490 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:39:27,707 INFO L93 Difference]: Finished difference Result 576 states and 850 transitions. [2024-10-14 05:39:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:39:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-10-14 05:39:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:39:27,709 INFO L225 Difference]: With dead ends: 576 [2024-10-14 05:39:27,710 INFO L226 Difference]: Without dead ends: 367 [2024-10-14 05:39:27,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:39:27,713 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 523 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:39:27,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1884 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:39:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-14 05:39:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 348. [2024-10-14 05:39:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4870317002881845) internal successors, (516), 347 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 516 transitions. [2024-10-14 05:39:27,734 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 516 transitions. Word has length 80 [2024-10-14 05:39:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:39:27,735 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 516 transitions. [2024-10-14 05:39:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 516 transitions. [2024-10-14 05:39:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 05:39:27,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:39:27,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:39:27,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:39:27,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:39:27,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:39:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1516682168, now seen corresponding path program 1 times [2024-10-14 05:39:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:39:27,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295977478] [2024-10-14 05:39:27,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:39:27,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:39:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:39:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:39:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:39:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295977478] [2024-10-14 05:39:28,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295977478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:39:28,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:39:28,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:39:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355963098] [2024-10-14 05:39:28,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:39:28,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:39:28,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:39:28,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:39:28,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:39:28,175 INFO L87 Difference]: Start difference. First operand 348 states and 516 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:39:28,416 INFO L93 Difference]: Finished difference Result 578 states and 852 transitions. [2024-10-14 05:39:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:39:28,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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 81 [2024-10-14 05:39:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:39:28,418 INFO L225 Difference]: With dead ends: 578 [2024-10-14 05:39:28,419 INFO L226 Difference]: Without dead ends: 369 [2024-10-14 05:39:28,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 05:39:28,420 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 526 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:39:28,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 2814 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:39:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-14 05:39:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 351. [2024-10-14 05:39:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 350 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 520 transitions. [2024-10-14 05:39:28,428 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 520 transitions. Word has length 81 [2024-10-14 05:39:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:39:28,428 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 520 transitions. [2024-10-14 05:39:28,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 520 transitions. [2024-10-14 05:39:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 05:39:28,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:39:28,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:39:28,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:39:28,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:39:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:39:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash 91853719, now seen corresponding path program 1 times [2024-10-14 05:39:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:39:28,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775757607] [2024-10-14 05:39:28,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:39:28,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:39:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:39:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:39:29,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:39:29,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775757607] [2024-10-14 05:39:29,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775757607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:39:29,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:39:29,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:39:29,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191296667] [2024-10-14 05:39:29,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:39:29,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:39:29,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:39:29,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:39:29,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:39:29,361 INFO L87 Difference]: Start difference. First operand 351 states and 520 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:39:29,644 INFO L93 Difference]: Finished difference Result 578 states and 851 transitions. [2024-10-14 05:39:29,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:39:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 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 82 [2024-10-14 05:39:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:39:29,646 INFO L225 Difference]: With dead ends: 578 [2024-10-14 05:39:29,646 INFO L226 Difference]: Without dead ends: 369 [2024-10-14 05:39:29,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:39:29,648 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 521 mSDsluCounter, 2795 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 3260 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:39:29,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 3260 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:39:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-14 05:39:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 355. [2024-10-14 05:39:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 354 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 525 transitions. [2024-10-14 05:39:29,658 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 525 transitions. Word has length 82 [2024-10-14 05:39:29,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:39:29,659 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 525 transitions. [2024-10-14 05:39:29,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 525 transitions. [2024-10-14 05:39:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 05:39:29,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:39:29,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:39:29,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:39:29,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:39:29,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:39:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash 117043575, now seen corresponding path program 1 times [2024-10-14 05:39:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:39:29,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411986322] [2024-10-14 05:39:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:39:29,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:39:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:39:29,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 05:39:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:39:29,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 05:39:29,829 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 05:39:29,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 05:39:29,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:39:29,835 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 05:39:29,915 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 05:39:29,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:39:29 BoogieIcfgContainer [2024-10-14 05:39:29,918 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 05:39:29,918 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 05:39:29,918 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 05:39:29,919 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 05:39:29,919 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:39:25" (3/4) ... [2024-10-14 05:39:29,921 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 05:39:29,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 05:39:29,923 INFO L158 Benchmark]: Toolchain (without parser) took 7961.28ms. Allocated memory was 184.5MB in the beginning and 383.8MB in the end (delta: 199.2MB). Free memory was 150.3MB in the beginning and 179.5MB in the end (delta: -29.2MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. [2024-10-14 05:39:29,923 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 184.5MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:39:29,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.96ms. Allocated memory is still 184.5MB. Free memory was 150.3MB in the beginning and 109.8MB in the end (delta: 40.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-14 05:39:29,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 188.50ms. Allocated memory is still 184.5MB. Free memory was 109.8MB in the beginning and 81.1MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 05:39:29,924 INFO L158 Benchmark]: Boogie Preprocessor took 323.93ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 81.1MB in the beginning and 207.4MB in the end (delta: -126.3MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2024-10-14 05:39:29,924 INFO L158 Benchmark]: RCFGBuilder took 1974.81ms. Allocated memory is still 266.3MB. Free memory was 207.4MB in the beginning and 135.3MB in the end (delta: 72.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2024-10-14 05:39:29,924 INFO L158 Benchmark]: TraceAbstraction took 4809.55ms. Allocated memory was 266.3MB in the beginning and 383.8MB in the end (delta: 117.4MB). Free memory was 134.2MB in the beginning and 179.5MB in the end (delta: -45.3MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2024-10-14 05:39:29,925 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 383.8MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:39:29,928 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 184.5MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 653.96ms. Allocated memory is still 184.5MB. Free memory was 150.3MB in the beginning and 109.8MB in the end (delta: 40.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 188.50ms. Allocated memory is still 184.5MB. Free memory was 109.8MB in the beginning and 81.1MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 323.93ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 81.1MB in the beginning and 207.4MB in the end (delta: -126.3MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1974.81ms. Allocated memory is still 266.3MB. Free memory was 207.4MB in the beginning and 135.3MB in the end (delta: 72.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4809.55ms. Allocated memory was 266.3MB in the beginning and 383.8MB in the end (delta: 117.4MB). Free memory was 134.2MB in the beginning and 179.5MB in the end (delta: -45.3MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 383.8MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 261, overapproximation of bitwiseAnd at line 266. 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_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L30] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_1 var_56 = 0; [L39] const SORT_6 var_60 = 0; [L40] const SORT_1 var_73 = 1; [L41] const SORT_14 var_77 = 0; [L42] const SORT_10 var_98 = 0; [L44] SORT_1 input_2; [L45] SORT_1 input_3; [L46] SORT_1 input_4; [L47] SORT_1 input_5; [L48] SORT_6 input_7; [L49] SORT_6 input_8; [L50] SORT_1 input_9; [L51] SORT_10 input_11; [L52] SORT_1 input_12; [L53] SORT_1 input_13; [L54] SORT_14 input_15; [L55] SORT_10 input_16; [L56] SORT_1 input_17; [L57] SORT_6 input_18; [L58] SORT_1 input_19; [L59] SORT_10 input_20; [L60] SORT_10 input_21; [L61] SORT_6 input_22; [L62] SORT_6 input_23; [L63] SORT_1 input_24; [L64] SORT_14 input_25; [L65] SORT_10 input_26; [L66] SORT_1 input_27; [L67] SORT_6 input_28; [L68] SORT_6 input_29; [L69] SORT_6 input_30; [L70] SORT_6 input_31; [L71] SORT_10 input_32; [L72] SORT_10 input_33; [L73] SORT_10 input_34; [L74] SORT_10 input_35; [L75] SORT_10 input_36; [L76] SORT_10 input_37; [L77] SORT_10 input_38; [L78] SORT_10 input_39; [L79] SORT_1 input_40; [L80] SORT_1 input_41; [L81] SORT_1 input_42; [L82] SORT_1 input_43; [L83] SORT_1 input_44; [L84] SORT_1 input_45; [L85] SORT_14 input_46; [L86] SORT_14 input_47; [L87] SORT_14 input_48; [L88] SORT_14 input_49; [L89] SORT_6 input_50; [L90] SORT_6 input_51; [L91] SORT_1 input_52; [L92] SORT_1 input_53; [L93] SORT_1 input_54; [L94] SORT_1 input_55; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L96] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L97] SORT_6 state_61 = __VERIFIER_nondet_uint() & mask_SORT_6; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L98] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L99] SORT_6 state_66 = __VERIFIER_nondet_uint() & mask_SORT_6; [L100] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L100] SORT_14 state_78 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L101] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L101] SORT_14 state_81 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L102] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L103] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L103] SORT_1 state_90 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L104] SORT_1 state_93 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L105] SORT_10 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L106] SORT_10 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L107] SORT_1 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L108] SORT_1 state_123 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L109] SORT_10 state_135 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L110] SORT_10 state_138 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L111] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L111] SORT_6 state_148 = __VERIFIER_nondet_uint() & mask_SORT_6; [L112] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L112] SORT_6 state_156 = __VERIFIER_nondet_uint() & mask_SORT_6; [L113] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L113] SORT_14 state_170 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L114] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L114] SORT_14 state_173 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L115] SORT_1 state_176 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L116] SORT_10 state_179 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L117] SORT_1 state_184 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L118] SORT_1 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L119] SORT_10 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L120] SORT_1 state_212 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L121] SORT_10 state_217 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L122] SORT_1 state_223 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L123] SORT_10 state_238 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L124] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L124] SORT_6 state_249 = __VERIFIER_nondet_uint() & mask_SORT_6; [L125] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L125] SORT_6 state_282 = __VERIFIER_nondet_uint() & mask_SORT_6; [L127] SORT_1 init_58_arg_1 = var_56; [L128] state_57 = init_58_arg_1 [L129] SORT_6 init_62_arg_1 = var_60; [L130] state_61 = init_62_arg_1 [L131] SORT_1 init_64_arg_1 = var_56; [L132] state_63 = init_64_arg_1 [L133] SORT_6 init_67_arg_1 = var_60; [L134] state_66 = init_67_arg_1 [L135] SORT_14 init_79_arg_1 = var_77; [L136] state_78 = init_79_arg_1 [L137] SORT_14 init_82_arg_1 = var_77; [L138] state_81 = init_82_arg_1 [L139] SORT_1 init_85_arg_1 = var_56; [L140] state_84 = init_85_arg_1 [L141] SORT_1 init_91_arg_1 = var_56; [L142] state_90 = init_91_arg_1 [L143] SORT_1 init_94_arg_1 = var_56; [L144] state_93 = init_94_arg_1 [L145] SORT_10 init_100_arg_1 = var_98; [L146] state_99 = init_100_arg_1 [L147] SORT_10 init_103_arg_1 = var_98; [L148] state_102 = init_103_arg_1 [L149] SORT_1 init_117_arg_1 = var_56; [L150] state_116 = init_117_arg_1 [L151] SORT_1 init_124_arg_1 = var_56; [L152] state_123 = init_124_arg_1 [L153] SORT_10 init_136_arg_1 = var_98; [L154] state_135 = init_136_arg_1 [L155] SORT_10 init_139_arg_1 = var_98; [L156] state_138 = init_139_arg_1 [L157] SORT_6 init_149_arg_1 = var_60; [L158] state_148 = init_149_arg_1 [L159] SORT_6 init_157_arg_1 = var_60; [L160] state_156 = init_157_arg_1 [L161] SORT_14 init_171_arg_1 = var_77; [L162] state_170 = init_171_arg_1 [L163] SORT_14 init_174_arg_1 = var_77; [L164] state_173 = init_174_arg_1 [L165] SORT_1 init_177_arg_1 = var_56; [L166] state_176 = init_177_arg_1 [L167] SORT_10 init_180_arg_1 = var_98; [L168] state_179 = init_180_arg_1 [L169] SORT_1 init_185_arg_1 = var_56; [L170] state_184 = init_185_arg_1 [L171] SORT_1 init_192_arg_1 = var_56; [L172] state_191 = init_192_arg_1 [L173] SORT_10 init_197_arg_1 = var_98; [L174] state_196 = init_197_arg_1 [L175] SORT_1 init_213_arg_1 = var_56; [L176] state_212 = init_213_arg_1 [L177] SORT_10 init_218_arg_1 = var_98; [L178] state_217 = init_218_arg_1 [L179] SORT_1 init_224_arg_1 = var_56; [L180] state_223 = init_224_arg_1 [L181] SORT_10 init_239_arg_1 = var_98; [L182] state_238 = init_239_arg_1 [L183] SORT_6 init_250_arg_1 = var_60; [L184] state_249 = init_250_arg_1 [L185] SORT_6 init_283_arg_1 = var_60; [L186] state_282 = init_283_arg_1 VAL [mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L189] input_2 = __VERIFIER_nondet_uchar() [L190] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L190] input_2 = input_2 & mask_SORT_1 [L191] input_3 = __VERIFIER_nondet_uchar() [L192] input_4 = __VERIFIER_nondet_uchar() [L193] input_5 = __VERIFIER_nondet_uchar() [L194] input_7 = __VERIFIER_nondet_uint() [L195] input_8 = __VERIFIER_nondet_uint() [L196] input_9 = __VERIFIER_nondet_uchar() [L197] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L197] input_9 = input_9 & mask_SORT_1 [L198] input_11 = __VERIFIER_nondet_uchar() [L199] input_12 = __VERIFIER_nondet_uchar() [L200] input_13 = __VERIFIER_nondet_uchar() [L201] input_15 = __VERIFIER_nondet_ulong() [L202] input_16 = __VERIFIER_nondet_uchar() [L203] input_17 = __VERIFIER_nondet_uchar() [L204] input_18 = __VERIFIER_nondet_uint() [L205] input_19 = __VERIFIER_nondet_uchar() [L206] input_20 = __VERIFIER_nondet_uchar() [L207] input_21 = __VERIFIER_nondet_uchar() [L208] input_22 = __VERIFIER_nondet_uint() [L209] input_23 = __VERIFIER_nondet_uint() [L210] input_24 = __VERIFIER_nondet_uchar() [L211] input_25 = __VERIFIER_nondet_ulong() [L212] input_26 = __VERIFIER_nondet_uchar() [L213] input_27 = __VERIFIER_nondet_uchar() [L214] input_28 = __VERIFIER_nondet_uint() [L215] input_29 = __VERIFIER_nondet_uint() [L216] input_30 = __VERIFIER_nondet_uint() [L217] input_31 = __VERIFIER_nondet_uint() [L218] input_32 = __VERIFIER_nondet_uchar() [L219] input_33 = __VERIFIER_nondet_uchar() [L220] input_34 = __VERIFIER_nondet_uchar() [L221] input_35 = __VERIFIER_nondet_uchar() [L222] input_36 = __VERIFIER_nondet_uchar() [L223] input_37 = __VERIFIER_nondet_uchar() [L224] input_38 = __VERIFIER_nondet_uchar() [L225] input_39 = __VERIFIER_nondet_uchar() [L226] input_40 = __VERIFIER_nondet_uchar() [L227] input_41 = __VERIFIER_nondet_uchar() [L228] input_42 = __VERIFIER_nondet_uchar() [L229] input_43 = __VERIFIER_nondet_uchar() [L230] input_44 = __VERIFIER_nondet_uchar() [L231] input_45 = __VERIFIER_nondet_uchar() [L232] input_46 = __VERIFIER_nondet_ulong() [L233] input_47 = __VERIFIER_nondet_ulong() [L234] input_48 = __VERIFIER_nondet_ulong() [L235] input_49 = __VERIFIER_nondet_ulong() [L236] input_50 = __VERIFIER_nondet_uint() [L237] input_51 = __VERIFIER_nondet_uint() [L238] input_52 = __VERIFIER_nondet_uchar() [L239] input_53 = __VERIFIER_nondet_uchar() [L240] input_54 = __VERIFIER_nondet_uchar() [L241] input_55 = __VERIFIER_nondet_uchar() [L244] SORT_1 var_59_arg_0 = state_57; [L245] SORT_1 var_59 = ~var_59_arg_0; [L246] SORT_1 var_65_arg_0 = state_63; [L247] SORT_6 var_65_arg_1 = state_61; [L248] SORT_6 var_65_arg_2 = input_18; [L249] SORT_6 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; VAL [input_18=0, input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L250] EXPR var_65 & mask_SORT_6 VAL [input_18=0, input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_73=1, var_77=0, var_98=0] [L250] var_65 = var_65 & mask_SORT_6 [L251] SORT_1 var_68_arg_0 = state_63; [L252] SORT_6 var_68_arg_1 = state_66; [L253] SORT_6 var_68_arg_2 = input_18; [L254] SORT_6 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_68=0, var_73=1, var_77=0, var_98=0] [L255] EXPR var_68 & mask_SORT_6 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L255] var_68 = var_68 & mask_SORT_6 [L256] SORT_6 var_69_arg_0 = var_65; [L257] SORT_6 var_69_arg_1 = var_68; [L258] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L259] SORT_1 var_70_arg_0 = var_59; [L260] SORT_1 var_70_arg_1 = var_69; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_70_arg_0=-1, var_70_arg_1=1, var_73=1, var_77=0, var_98=0] [L261] EXPR var_70_arg_0 | var_70_arg_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L261] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L262] SORT_1 var_74_arg_0 = var_70; [L263] SORT_1 var_74 = ~var_74_arg_0; [L264] SORT_1 var_75_arg_0 = var_73; [L265] SORT_1 var_75_arg_1 = var_74; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_75_arg_0=1, var_75_arg_1=-1, var_77=0, var_98=0] [L266] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L266] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L267] EXPR var_75 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L267] var_75 = var_75 & mask_SORT_1 [L268] SORT_1 bad_76_arg_0 = var_75; [L269] CALL __VERIFIER_assert(!(bad_76_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 327 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1570 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1570 mSDsluCounter, 10843 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8473 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 330 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 2370 mSDtfsCounter, 330 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 1397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 05:39:29,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.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 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:39:32,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:39:32,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 05:39:32,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:39:32,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:39:32,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:39:32,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:39:32,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:39:32,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:39:32,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:39:32,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:39:32,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:39:32,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:39:32,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:39:32,308 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:39:32,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:39:32,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:39:32,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:39:32,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:39:32,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:39:32,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:39:32,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 05:39:32,311 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 05:39:32,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:39:32,312 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 05:39:32,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:39:32,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:39:32,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:39:32,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:39:32,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:39:32,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:39:32,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:39:32,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:39:32,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:39:32,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:39:32,317 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 05:39:32,317 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 05:39:32,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:39:32,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:39:32,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:39:32,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:39:32,319 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 05:39:32,319 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 -> 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a [2024-10-14 05:39:32,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:39:32,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:39:32,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:39:32,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:39:32,699 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:39:32,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2024-10-14 05:39:34,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:39:34,530 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:39:34,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2024-10-14 05:39:34,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c07b805e/87e79b4a0643418d826955f743835c27/FLAG5258f0521 [2024-10-14 05:39:34,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c07b805e/87e79b4a0643418d826955f743835c27 [2024-10-14 05:39:34,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:39:34,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:39:34,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:39:34,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:39:34,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:39:34,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:39:34" (1/1) ... [2024-10-14 05:39:34,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51bc7d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:34, skipping insertion in model container [2024-10-14 05:39:34,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:39:34" (1/1) ... [2024-10-14 05:39:34,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:39:35,100 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c[1244,1257] [2024-10-14 05:39:35,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:39:35,363 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:39:35,380 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c[1244,1257] [2024-10-14 05:39:35,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:39:35,517 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:39:35,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35 WrapperNode [2024-10-14 05:39:35,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:39:35,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:39:35,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:39:35,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:39:35,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,647 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1158 [2024-10-14 05:39:35,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:39:35,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:39:35,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:39:35,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:39:35,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,702 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-14 05:39:35,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:39:35,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:39:35,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:39:35,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:39:35,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (1/1) ... [2024-10-14 05:39:35,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:39:35,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:39:35,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:39:35,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:39:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:39:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 05:39:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 05:39:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:39:35,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:39:36,100 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:39:36,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:39:37,047 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-14 05:39:37,049 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:39:37,121 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:39:37,124 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 05:39:37,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:39:37 BoogieIcfgContainer [2024-10-14 05:39:37,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:39:37,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:39:37,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:39:37,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:39:37,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:39:34" (1/3) ... [2024-10-14 05:39:37,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76aa89f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:39:37, skipping insertion in model container [2024-10-14 05:39:37,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:39:35" (2/3) ... [2024-10-14 05:39:37,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76aa89f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:39:37, skipping insertion in model container [2024-10-14 05:39:37,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:39:37" (3/3) ... [2024-10-14 05:39:37,135 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal1.c [2024-10-14 05:39:37,153 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:39:37,153 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 05:39:37,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:39:37,215 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;@44a06663, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:39:37,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 05:39:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 05:39:37,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:39:37,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 05:39:37,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:39:37,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:39:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 05:39:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:39:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132265601] [2024-10-14 05:39:37,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:39:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:39:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:39:37,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:39:37,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 05:39:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:39:37,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 05:39:37,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:39:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:39:37,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:39:37,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:39:37,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132265601] [2024-10-14 05:39:37,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132265601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:39:37,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:39:37,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:39:37,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618978932] [2024-10-14 05:39:37,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:39:37,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:39:37,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:39:37,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:39:37,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:39:37,746 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:39:37,972 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 05:39:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:39:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 05:39:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:39:37,982 INFO L225 Difference]: With dead ends: 15 [2024-10-14 05:39:37,982 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 05:39:37,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:39:37,992 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:39:37,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:39:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 05:39:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 05:39:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 05:39:38,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 05:39:38,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:39:38,023 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 05:39:38,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 05:39:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 05:39:38,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:39:38,024 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 05:39:38,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 05:39:38,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:39:38,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:39:38,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:39:38,227 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 05:39:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:39:38,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984158090] [2024-10-14 05:39:38,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:39:38,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:39:38,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:39:38,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:39:38,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 05:39:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:39:38,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 05:39:38,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:39:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:39:38,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:39:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:39:39,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:39:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984158090] [2024-10-14 05:39:39,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984158090] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:39:39,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 05:39:39,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 05:39:39,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882770820] [2024-10-14 05:39:39,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 05:39:39,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:39:39,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:39:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:39:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:39:39,638 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:39:40,201 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-14 05:39:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:39:40,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 05:39:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:39:40,202 INFO L225 Difference]: With dead ends: 14 [2024-10-14 05:39:40,202 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 05:39:40,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:39:40,204 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:39:40,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:39:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 05:39:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-14 05:39:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-10-14 05:39:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 05:39:40,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 05:39:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:39:40,208 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 05:39:40,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:39:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 05:39:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 05:39:40,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:39:40,209 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 05:39:40,219 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-10-14 05:39:40,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:39:40,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:39:40,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:39:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 05:39:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:39:40,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687811385] [2024-10-14 05:39:40,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 05:39:40,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:39:40,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:39:40,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:39:40,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 05:39:41,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 05:39:41,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 05:39:41,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 05:39:41,251 INFO L278 TraceCheckSpWp]: Computing forward predicates...