./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.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 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:48:18,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:48:18,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:48:18,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:48:18,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:48:18,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:48:18,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:48:18,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:48:18,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:48:18,919 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:48:18,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:48:18,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:48:18,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:48:18,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:48:18,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:48:18,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:48:18,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:48:18,921 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 [2025-03-16 22:48:19,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:48:19,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:48:19,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:48:19,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:48:19,133 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:48:19,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-16 22:48:20,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/747268bd3/8f043efc0d0d42489c22eb461aac161b/FLAG6bb5984c1 [2025-03-16 22:48:20,541 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:48:20,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-16 22:48:20,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/747268bd3/8f043efc0d0d42489c22eb461aac161b/FLAG6bb5984c1 [2025-03-16 22:48:20,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/747268bd3/8f043efc0d0d42489c22eb461aac161b [2025-03-16 22:48:20,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:48:20,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:48:20,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:48:20,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:48:20,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:48:20,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:48:20" (1/1) ... [2025-03-16 22:48:20,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:20, skipping insertion in model container [2025-03-16 22:48:20,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:48:20" (1/1) ... [2025-03-16 22:48:20,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:48:20,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-03-16 22:48:21,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:48:21,252 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:48:21,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-03-16 22:48:21,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:48:21,385 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:48:21,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21 WrapperNode [2025-03-16 22:48:21,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:48:21,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:48:21,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:48:21,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:48:21,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:21,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:21,780 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4859 [2025-03-16 22:48:21,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:48:21,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:48:21,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:48:21,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:48:21,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:21,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:21,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:21,992 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:48:21,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:21,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:22,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:22,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:22,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:22,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:22,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:48:22,270 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:48:22,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:48:22,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:48:22,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (1/1) ... [2025-03-16 22:48:22,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:48:22,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:48:22,294 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) [2025-03-16 22:48:22,300 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 [2025-03-16 22:48:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:48:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:48:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:48:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:48:22,620 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:48:22,621 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:48:26,321 INFO L? ?]: Removed 2852 outVars from TransFormulas that were not future-live. [2025-03-16 22:48:26,321 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:48:26,489 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:48:26,489 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:48:26,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:48:26 BoogieIcfgContainer [2025-03-16 22:48:26,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:48:26,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:48:26,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:48:26,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:48:26,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:48:20" (1/3) ... [2025-03-16 22:48:26,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234e6246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:48:26, skipping insertion in model container [2025-03-16 22:48:26,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:21" (2/3) ... [2025-03-16 22:48:26,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234e6246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:48:26, skipping insertion in model container [2025-03-16 22:48:26,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:48:26" (3/3) ... [2025-03-16 22:48:26,497 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-16 22:48:26,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:48:26,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c that has 1 procedures, 1520 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:48:26,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:48:26,598 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;@742364a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:48:26,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:48:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 1520 states, 1518 states have (on average 1.5) internal successors, (2277), 1519 states have internal predecessors, (2277), 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) [2025-03-16 22:48:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 22:48:26,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:26,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:48:26,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:26,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1196576118, now seen corresponding path program 1 times [2025-03-16 22:48:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865856483] [2025-03-16 22:48:26,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:26,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 22:48:26,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 22:48:26,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:26,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:27,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:27,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865856483] [2025-03-16 22:48:27,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865856483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:48:27,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:48:27,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:48:27,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172172467] [2025-03-16 22:48:27,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:48:27,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:48:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:27,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:48:27,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:48:27,762 INFO L87 Difference]: Start difference. First operand has 1520 states, 1518 states have (on average 1.5) internal successors, (2277), 1519 states have internal predecessors, (2277), 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 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:29,111 INFO L93 Difference]: Finished difference Result 3014 states and 4518 transitions. [2025-03-16 22:48:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:48:29,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-16 22:48:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:29,130 INFO L225 Difference]: With dead ends: 3014 [2025-03-16 22:48:29,130 INFO L226 Difference]: Without dead ends: 1539 [2025-03-16 22:48:29,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:48:29,140 INFO L435 NwaCegarLoop]: 1882 mSDtfsCounter, 2297 mSDsluCounter, 9404 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 11286 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:29,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 11286 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 22:48:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2025-03-16 22:48:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1533. [2025-03-16 22:48:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.498041775456919) internal successors, (2295), 1532 states have internal predecessors, (2295), 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) [2025-03-16 22:48:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2295 transitions. [2025-03-16 22:48:29,224 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2295 transitions. Word has length 40 [2025-03-16 22:48:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:29,224 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2295 transitions. [2025-03-16 22:48:29,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2295 transitions. [2025-03-16 22:48:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 22:48:29,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:29,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:48:29,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:48:29,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:29,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1753271021, now seen corresponding path program 1 times [2025-03-16 22:48:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846089617] [2025-03-16 22:48:29,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:29,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 22:48:29,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 22:48:29,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:29,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:29,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846089617] [2025-03-16 22:48:29,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846089617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:48:29,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:48:29,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:48:29,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084319446] [2025-03-16 22:48:29,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:48:29,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:48:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:29,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:48:29,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:48:29,403 INFO L87 Difference]: Start difference. First operand 1533 states and 2295 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:29,959 INFO L93 Difference]: Finished difference Result 1537 states and 2299 transitions. [2025-03-16 22:48:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:48:29,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-16 22:48:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:29,963 INFO L225 Difference]: With dead ends: 1537 [2025-03-16 22:48:29,964 INFO L226 Difference]: Without dead ends: 1535 [2025-03-16 22:48:29,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:48:29,964 INFO L435 NwaCegarLoop]: 1894 mSDtfsCounter, 0 mSDsluCounter, 3783 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5677 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:29,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5677 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:48:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-03-16 22:48:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2025-03-16 22:48:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.4973924380704042) internal successors, (2297), 1534 states have internal predecessors, (2297), 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) [2025-03-16 22:48:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2297 transitions. [2025-03-16 22:48:29,992 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2297 transitions. Word has length 41 [2025-03-16 22:48:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:29,993 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2297 transitions. [2025-03-16 22:48:29,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2297 transitions. [2025-03-16 22:48:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 22:48:29,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:29,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:48:29,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:48:29,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:29,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1487854860, now seen corresponding path program 1 times [2025-03-16 22:48:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:29,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695401321] [2025-03-16 22:48:29,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:30,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 22:48:30,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 22:48:30,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:30,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:30,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695401321] [2025-03-16 22:48:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695401321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:48:30,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:48:30,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:48:30,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70520228] [2025-03-16 22:48:30,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:48:30,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:48:30,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:30,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:48:30,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:48:30,125 INFO L87 Difference]: Start difference. First operand 1535 states and 2297 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:30,695 INFO L93 Difference]: Finished difference Result 3012 states and 4509 transitions. [2025-03-16 22:48:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:48:30,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-16 22:48:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:30,701 INFO L225 Difference]: With dead ends: 3012 [2025-03-16 22:48:30,702 INFO L226 Difference]: Without dead ends: 1537 [2025-03-16 22:48:30,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:48:30,707 INFO L435 NwaCegarLoop]: 1894 mSDtfsCounter, 0 mSDsluCounter, 3780 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5674 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:30,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5674 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:48:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2025-03-16 22:48:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1537. [2025-03-16 22:48:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 1.4967447916666667) internal successors, (2299), 1536 states have internal predecessors, (2299), 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) [2025-03-16 22:48:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2299 transitions. [2025-03-16 22:48:30,739 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2299 transitions. Word has length 42 [2025-03-16 22:48:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:30,739 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 2299 transitions. [2025-03-16 22:48:30,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2299 transitions. [2025-03-16 22:48:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 22:48:30,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:30,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:48:30,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:48:30,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:30,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash 810372142, now seen corresponding path program 1 times [2025-03-16 22:48:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933171166] [2025-03-16 22:48:30,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:30,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:48:30,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:48:30,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:30,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:31,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933171166] [2025-03-16 22:48:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933171166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:48:31,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:48:31,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:48:31,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554358745] [2025-03-16 22:48:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:48:31,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:48:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:31,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:48:31,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:48:31,126 INFO L87 Difference]: Start difference. First operand 1537 states and 2299 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:32,463 INFO L93 Difference]: Finished difference Result 3026 states and 4528 transitions. [2025-03-16 22:48:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:48:32,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 22:48:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:32,468 INFO L225 Difference]: With dead ends: 3026 [2025-03-16 22:48:32,469 INFO L226 Difference]: Without dead ends: 1549 [2025-03-16 22:48:32,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:48:32,474 INFO L435 NwaCegarLoop]: 1880 mSDtfsCounter, 2257 mSDsluCounter, 11267 mSDsCounter, 0 mSdLazyCounter, 2767 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 13147 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:32,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 13147 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2767 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 22:48:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-03-16 22:48:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1547. [2025-03-16 22:48:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1546 states have (on average 1.4961190168175937) internal successors, (2313), 1546 states have internal predecessors, (2313), 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) [2025-03-16 22:48:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2313 transitions. [2025-03-16 22:48:32,501 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2313 transitions. Word has length 43 [2025-03-16 22:48:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:32,502 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2313 transitions. [2025-03-16 22:48:32,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2313 transitions. [2025-03-16 22:48:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 22:48:32,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:32,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:48:32,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:48:32,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:32,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:32,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1998915309, now seen corresponding path program 1 times [2025-03-16 22:48:32,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:32,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726514578] [2025-03-16 22:48:32,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:32,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:32,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:48:32,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:48:32,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:32,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726514578] [2025-03-16 22:48:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726514578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:48:32,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:48:32,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:48:32,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441895075] [2025-03-16 22:48:32,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:48:32,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:48:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:32,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:48:32,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:48:32,965 INFO L87 Difference]: Start difference. First operand 1547 states and 2313 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:34,403 INFO L93 Difference]: Finished difference Result 3041 states and 4548 transitions. [2025-03-16 22:48:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:48:34,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 22:48:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:34,407 INFO L225 Difference]: With dead ends: 3041 [2025-03-16 22:48:34,408 INFO L226 Difference]: Without dead ends: 1554 [2025-03-16 22:48:34,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:48:34,411 INFO L435 NwaCegarLoop]: 1837 mSDtfsCounter, 2291 mSDsluCounter, 11010 mSDsCounter, 0 mSdLazyCounter, 3089 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 12847 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:34,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 12847 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3089 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 22:48:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-16 22:48:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1551. [2025-03-16 22:48:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 1.495483870967742) internal successors, (2318), 1550 states have internal predecessors, (2318), 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) [2025-03-16 22:48:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2318 transitions. [2025-03-16 22:48:34,434 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2318 transitions. Word has length 43 [2025-03-16 22:48:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:34,435 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2318 transitions. [2025-03-16 22:48:34,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2318 transitions. [2025-03-16 22:48:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 22:48:34,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:34,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:48:34,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:48:34,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:34,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash 494896076, now seen corresponding path program 1 times [2025-03-16 22:48:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:34,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847354320] [2025-03-16 22:48:34,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:34,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:34,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 22:48:34,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 22:48:34,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:34,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:34,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847354320] [2025-03-16 22:48:34,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847354320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:48:34,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:48:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:48:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982811417] [2025-03-16 22:48:34,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:48:34,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:48:34,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:34,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:48:34,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:48:34,635 INFO L87 Difference]: Start difference. First operand 1551 states and 2318 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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) [2025-03-16 22:48:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:35,345 INFO L93 Difference]: Finished difference Result 3042 states and 4549 transitions. [2025-03-16 22:48:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:48:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2025-03-16 22:48:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:35,349 INFO L225 Difference]: With dead ends: 3042 [2025-03-16 22:48:35,349 INFO L226 Difference]: Without dead ends: 1555 [2025-03-16 22:48:35,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:48:35,350 INFO L435 NwaCegarLoop]: 1887 mSDtfsCounter, 2240 mSDsluCounter, 5651 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 7538 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:35,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 7538 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:48:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2025-03-16 22:48:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1551. [2025-03-16 22:48:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 1.495483870967742) internal successors, (2318), 1550 states have internal predecessors, (2318), 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) [2025-03-16 22:48:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2318 transitions. [2025-03-16 22:48:35,370 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2318 transitions. Word has length 44 [2025-03-16 22:48:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:35,370 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2318 transitions. [2025-03-16 22:48:35,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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) [2025-03-16 22:48:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2318 transitions. [2025-03-16 22:48:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 22:48:35,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:35,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:48:35,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:48:35,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:35,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1767854940, now seen corresponding path program 1 times [2025-03-16 22:48:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:35,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434294611] [2025-03-16 22:48:35,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:35,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 22:48:35,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 22:48:35,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:35,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:35,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:35,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434294611] [2025-03-16 22:48:35,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434294611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:48:35,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:48:35,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:48:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484127975] [2025-03-16 22:48:35,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:48:35,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:48:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:35,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:48:35,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:48:35,562 INFO L87 Difference]: Start difference. First operand 1551 states and 2318 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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) [2025-03-16 22:48:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:36,167 INFO L93 Difference]: Finished difference Result 3044 states and 4553 transitions. [2025-03-16 22:48:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:48:36,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-03-16 22:48:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:36,171 INFO L225 Difference]: With dead ends: 3044 [2025-03-16 22:48:36,172 INFO L226 Difference]: Without dead ends: 1557 [2025-03-16 22:48:36,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:48:36,174 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2247 mSDsluCounter, 3776 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2247 SdHoareTripleChecker+Valid, 5667 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:36,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2247 Valid, 5667 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:48:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-03-16 22:48:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1554. [2025-03-16 22:48:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1553 states have (on average 1.4958145524790727) internal successors, (2323), 1553 states have internal predecessors, (2323), 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) [2025-03-16 22:48:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2323 transitions. [2025-03-16 22:48:36,193 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2323 transitions. Word has length 44 [2025-03-16 22:48:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:36,194 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2323 transitions. [2025-03-16 22:48:36,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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) [2025-03-16 22:48:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2323 transitions. [2025-03-16 22:48:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 22:48:36,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:36,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:48:36,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:48:36,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:36,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash -625222131, now seen corresponding path program 1 times [2025-03-16 22:48:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226042570] [2025-03-16 22:48:36,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:36,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 22:48:36,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 22:48:36,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:36,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:48:36,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:48:36,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 22:48:36,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 22:48:36,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:48:36,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:48:36,359 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:48:36,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:48:36,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:48:36,364 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:48:36,405 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:48:36,418 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:48:36,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:48:36 BoogieIcfgContainer [2025-03-16 22:48:36,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:48:36,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:48:36,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:48:36,424 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:48:36,424 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:48:26" (3/4) ... [2025-03-16 22:48:36,427 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:48:36,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:48:36,428 INFO L158 Benchmark]: Toolchain (without parser) took 15633.78ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 121.3MB in the beginning and 85.4MB in the end (delta: 36.0MB). Peak memory consumption was 373.5MB. Max. memory is 16.1GB. [2025-03-16 22:48:36,428 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:48:36,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.31ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 44.3MB in the end (delta: 77.0MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-16 22:48:36,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 393.70ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 44.3MB in the beginning and 65.8MB in the end (delta: -21.5MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2025-03-16 22:48:36,429 INFO L158 Benchmark]: Boogie Preprocessor took 487.15ms. Allocated memory was 176.2MB in the beginning and 394.3MB in the end (delta: 218.1MB). Free memory was 65.8MB in the beginning and 259.9MB in the end (delta: -194.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2025-03-16 22:48:36,430 INFO L158 Benchmark]: IcfgBuilder took 4219.63ms. Allocated memory was 394.3MB in the beginning and 788.5MB in the end (delta: 394.3MB). Free memory was 259.9MB in the beginning and 434.7MB in the end (delta: -174.8MB). Peak memory consumption was 240.2MB. Max. memory is 16.1GB. [2025-03-16 22:48:36,430 INFO L158 Benchmark]: TraceAbstraction took 9932.02ms. Allocated memory was 788.5MB in the beginning and 503.3MB in the end (delta: -285.2MB). Free memory was 431.3MB in the beginning and 85.4MB in the end (delta: 345.9MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2025-03-16 22:48:36,430 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 503.3MB. Free memory was 85.4MB in the beginning and 85.4MB in the end (delta: 64.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:48:36,432 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.24ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.31ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 44.3MB in the end (delta: 77.0MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 393.70ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 44.3MB in the beginning and 65.8MB in the end (delta: -21.5MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 487.15ms. Allocated memory was 176.2MB in the beginning and 394.3MB in the end (delta: 218.1MB). Free memory was 65.8MB in the beginning and 259.9MB in the end (delta: -194.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * IcfgBuilder took 4219.63ms. Allocated memory was 394.3MB in the beginning and 788.5MB in the end (delta: 394.3MB). Free memory was 259.9MB in the beginning and 434.7MB in the end (delta: -174.8MB). Peak memory consumption was 240.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9932.02ms. Allocated memory was 788.5MB in the beginning and 503.3MB in the end (delta: -285.2MB). Free memory was 431.3MB in the beginning and 85.4MB in the end (delta: 345.9MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 503.3MB. Free memory was 85.4MB in the beginning and 85.4MB in the end (delta: 64.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 214. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 12); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (12 - 1); [L29] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 1); [L30] const SORT_8 msb_SORT_8 = (SORT_8)1 << (1 - 1); [L32] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 4); [L33] const SORT_13 msb_SORT_13 = (SORT_13)1 << (4 - 1); [L35] const SORT_97 mask_SORT_97 = (SORT_97)-1 >> (sizeof(SORT_97) * 8 - 3); [L36] const SORT_97 msb_SORT_97 = (SORT_97)1 << (3 - 1); [L38] const SORT_305 mask_SORT_305 = (SORT_305)-1 >> (sizeof(SORT_305) * 8 - 2); [L39] const SORT_305 msb_SORT_305 = (SORT_305)1 << (2 - 1); [L41] const SORT_309 mask_SORT_309 = (SORT_309)-1 >> (sizeof(SORT_309) * 8 - 5); [L42] const SORT_309 msb_SORT_309 = (SORT_309)1 << (5 - 1); [L44] const SORT_311 mask_SORT_311 = (SORT_311)-1 >> (sizeof(SORT_311) * 8 - 6); [L45] const SORT_311 msb_SORT_311 = (SORT_311)1 << (6 - 1); [L47] const SORT_313 mask_SORT_313 = (SORT_313)-1 >> (sizeof(SORT_313) * 8 - 7); [L48] const SORT_313 msb_SORT_313 = (SORT_313)1 << (7 - 1); [L50] const SORT_315 mask_SORT_315 = (SORT_315)-1 >> (sizeof(SORT_315) * 8 - 8); [L51] const SORT_315 msb_SORT_315 = (SORT_315)1 << (8 - 1); [L53] const SORT_317 mask_SORT_317 = (SORT_317)-1 >> (sizeof(SORT_317) * 8 - 9); [L54] const SORT_317 msb_SORT_317 = (SORT_317)1 << (9 - 1); [L56] const SORT_319 mask_SORT_319 = (SORT_319)-1 >> (sizeof(SORT_319) * 8 - 10); [L57] const SORT_319 msb_SORT_319 = (SORT_319)1 << (10 - 1); [L59] const SORT_321 mask_SORT_321 = (SORT_321)-1 >> (sizeof(SORT_321) * 8 - 11); [L60] const SORT_321 msb_SORT_321 = (SORT_321)1 << (11 - 1); [L62] const SORT_8 var_18 = 0; [L63] const SORT_1 var_22 = 0; [L64] const SORT_1 var_25 = 2; [L65] const SORT_1 var_47 = 1; [L66] const SORT_8 var_52 = 1; [L67] const SORT_13 var_56 = 2; [L68] const SORT_13 var_61 = 9; [L69] const SORT_13 var_69 = 15; [L70] const SORT_13 var_74 = 1; [L71] const SORT_13 var_76 = 3; [L72] const SORT_13 var_79 = 5; [L73] const SORT_13 var_82 = 7; [L74] const SORT_13 var_85 = 11; [L75] const SORT_97 var_98 = 0; [L76] const SORT_13 var_111 = 8; [L77] const SORT_13 var_115 = 10; [L78] const SORT_13 var_119 = 13; [L79] const SORT_13 var_130 = 4; [L80] const SORT_13 var_132 = 12; [L81] const SORT_13 var_135 = 14; [L82] const SORT_13 var_141 = 6; [L83] const SORT_13 var_168 = 0; [L84] const SORT_97 var_216 = 1; [L85] const SORT_97 var_218 = 5; [L86] const SORT_1 var_245 = 4095; [L87] const SORT_321 var_592 = 0; [L89] SORT_1 input_2; [L90] SORT_1 input_3; [L91] SORT_1 input_4; [L92] SORT_1 input_5; [L93] SORT_1 input_6; [L94] SORT_1 input_7; [L95] SORT_8 input_9; [L96] SORT_8 input_10; [L97] SORT_8 input_11; [L98] SORT_1 input_12; [L99] SORT_13 input_14; [L100] SORT_8 input_15; [L101] SORT_8 input_16; [L102] SORT_8 input_17; [L103] SORT_1 input_210; [L104] SORT_97 input_212; [L105] SORT_1 input_232; [L106] SORT_97 input_235; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L108] SORT_8 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_8; [L109] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L109] SORT_1 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L110] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L110] SORT_1 state_28 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L111] SORT_1 state_30 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L112] SORT_1 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L113] SORT_1 state_35 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L114] SORT_1 state_39 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L115] SORT_1 state_41 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L116] SORT_1 state_58 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_97 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L117] SORT_97 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_97; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L118] SORT_1 state_128 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L120] SORT_8 init_20_arg_1 = var_18; [L121] state_19 = init_20_arg_1 [L122] SORT_1 init_24_arg_1 = var_22; [L123] state_23 = init_24_arg_1 [L124] SORT_1 init_29_arg_1 = var_22; [L125] state_28 = init_29_arg_1 [L126] SORT_1 init_31_arg_1 = var_22; [L127] state_30 = init_31_arg_1 [L128] SORT_1 init_34_arg_1 = var_22; [L129] state_33 = init_34_arg_1 [L130] SORT_1 init_36_arg_1 = var_22; [L131] state_35 = init_36_arg_1 [L132] SORT_1 init_40_arg_1 = var_22; [L133] state_39 = init_40_arg_1 [L134] SORT_1 init_42_arg_1 = var_22; [L135] state_41 = init_42_arg_1 [L136] SORT_1 init_59_arg_1 = var_22; [L137] state_58 = init_59_arg_1 [L138] SORT_97 init_100_arg_1 = var_98; [L139] state_99 = init_100_arg_1 [L140] SORT_1 init_129_arg_1 = var_22; [L141] state_128 = init_129_arg_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L144] input_2 = __VERIFIER_nondet_ushort() [L145] input_3 = __VERIFIER_nondet_ushort() [L146] input_4 = __VERIFIER_nondet_ushort() [L147] input_5 = __VERIFIER_nondet_ushort() [L148] input_6 = __VERIFIER_nondet_ushort() [L149] input_7 = __VERIFIER_nondet_ushort() [L150] input_9 = __VERIFIER_nondet_uchar() [L151] input_10 = __VERIFIER_nondet_uchar() [L152] input_11 = __VERIFIER_nondet_uchar() [L153] EXPR input_11 & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L153] input_11 = input_11 & mask_SORT_8 [L154] input_12 = __VERIFIER_nondet_ushort() [L155] input_14 = __VERIFIER_nondet_uchar() [L156] EXPR input_14 & mask_SORT_13 VAL [input_11=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L156] input_14 = input_14 & mask_SORT_13 [L157] input_15 = __VERIFIER_nondet_uchar() [L158] input_16 = __VERIFIER_nondet_uchar() [L159] input_17 = __VERIFIER_nondet_uchar() [L160] input_210 = __VERIFIER_nondet_ushort() [L161] input_212 = __VERIFIER_nondet_uchar() [L162] input_232 = __VERIFIER_nondet_ushort() [L163] input_235 = __VERIFIER_nondet_uchar() [L166] SORT_8 var_21_arg_0 = state_19; [L167] SORT_8 var_21_arg_1 = var_18; [L168] SORT_8 var_21 = var_21_arg_0 == var_21_arg_1; [L169] SORT_1 var_26_arg_0 = state_23; [L170] SORT_1 var_26_arg_1 = var_25; [L171] SORT_8 var_26 = var_26_arg_0 != var_26_arg_1; [L172] SORT_8 var_27_arg_0 = var_21; [L173] SORT_8 var_27_arg_1 = var_26; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27_arg_0=1, var_27_arg_1=1, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L174] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L174] SORT_8 var_27 = var_27_arg_0 | var_27_arg_1; [L175] SORT_8 var_44_arg_0 = var_18; [L176] SORT_1 var_44_arg_1 = input_7; [L177] SORT_1 var_44_arg_2 = input_6; [L178] SORT_1 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L179] SORT_8 var_43_arg_0 = var_18; [L180] SORT_1 var_43_arg_1 = state_41; [L181] SORT_1 var_43_arg_2 = state_39; [L182] SORT_1 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L183] SORT_8 var_45_arg_0 = var_18; [L184] SORT_1 var_45_arg_1 = var_44; [L185] SORT_1 var_45_arg_2 = var_43; [L186] SORT_1 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L187] SORT_8 var_37_arg_0 = var_18; [L188] SORT_1 var_37_arg_1 = state_35; [L189] SORT_1 var_37_arg_2 = state_33; [L190] SORT_1 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L191] SORT_8 var_32_arg_0 = var_18; [L192] SORT_1 var_32_arg_1 = state_30; [L193] SORT_1 var_32_arg_2 = state_28; [L194] SORT_1 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L195] SORT_8 var_38_arg_0 = var_18; [L196] SORT_1 var_38_arg_1 = var_37; [L197] SORT_1 var_38_arg_2 = var_32; [L198] SORT_1 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L199] SORT_8 var_46_arg_0 = var_18; [L200] SORT_1 var_46_arg_1 = var_45; [L201] SORT_1 var_46_arg_2 = var_38; [L202] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27=1, var_46=0, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L203] EXPR var_46 & mask_SORT_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27=1, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L203] var_46 = var_46 & mask_SORT_1 [L204] SORT_1 var_48_arg_0 = var_46; [L205] SORT_1 var_48_arg_1 = var_47; [L206] SORT_8 var_48 = var_48_arg_0 == var_48_arg_1; [L207] SORT_8 var_49_arg_0 = var_27; [L208] SORT_8 var_49_arg_1 = var_48; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_49_arg_0=1, var_49_arg_1=0, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L209] EXPR var_49_arg_0 | var_49_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L209] SORT_8 var_49 = var_49_arg_0 | var_49_arg_1; [L210] SORT_8 var_53_arg_0 = var_49; [L211] SORT_8 var_53 = ~var_53_arg_0; [L212] SORT_8 var_54_arg_0 = var_52; [L213] SORT_8 var_54_arg_1 = var_53; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_54_arg_0=1, var_54_arg_1=-2, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L214] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L214] SORT_8 var_54 = var_54_arg_0 & var_54_arg_1; [L215] EXPR var_54 & mask_SORT_8 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L215] var_54 = var_54 & mask_SORT_8 [L216] SORT_8 bad_55_arg_0 = var_54; [L217] CALL __VERIFIER_assert(!(bad_55_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1520 locations, 2277 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11332 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11332 mSDsluCounter, 61836 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48671 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13230 IncrementalHoareTripleChecker+Invalid, 13234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 13165 mSDtfsCounter, 13230 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1554occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 1348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 22:48:36,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.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 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:48:38,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:48:38,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:48:38,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:48:38,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:48:38,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:48:38,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:48:38,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:48:38,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:48:38,471 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:48:38,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:48:38,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:48:38,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:48:38,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:48:38,471 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:48:38,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:48:38,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:48:38,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:48:38,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:48:38,473 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:48:38,473 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:48:38,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:48:38,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:48:38,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:48:38,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:48:38,473 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 [2025-03-16 22:48:38,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:48:38,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:48:38,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:48:38,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:48:38,707 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:48:38,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-16 22:48:39,849 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/343f0cb78/664279079b624666abdd91e130d71190/FLAGc39c284f3 [2025-03-16 22:48:40,196 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:48:40,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-16 22:48:40,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/343f0cb78/664279079b624666abdd91e130d71190/FLAGc39c284f3 [2025-03-16 22:48:40,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/343f0cb78/664279079b624666abdd91e130d71190 [2025-03-16 22:48:40,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:48:40,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:48:40,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:48:40,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:48:40,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:48:40,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:40,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5663c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40, skipping insertion in model container [2025-03-16 22:48:40,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:40,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:48:40,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-03-16 22:48:40,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:48:40,660 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:48:40,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-03-16 22:48:40,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:48:40,798 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:48:40,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40 WrapperNode [2025-03-16 22:48:40,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:48:40,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:48:40,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:48:40,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:48:40,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:40,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:40,936 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1835 [2025-03-16 22:48:40,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:48:40,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:48:40,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:48:40,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:48:40,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:40,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:40,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:40,992 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:48:40,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:40,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:41,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:41,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:41,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:41,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:41,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:48:41,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:48:41,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:48:41,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:48:41,077 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (1/1) ... [2025-03-16 22:48:41,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:48:41,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:48:41,106 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) [2025-03-16 22:48:41,109 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 [2025-03-16 22:48:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:48:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:48:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:48:41,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:48:41,375 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:48:41,377 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:48:42,701 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-16 22:48:42,701 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:48:42,708 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:48:42,708 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:48:42,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:48:42 BoogieIcfgContainer [2025-03-16 22:48:42,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:48:42,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:48:42,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:48:42,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:48:42,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:48:40" (1/3) ... [2025-03-16 22:48:42,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a1cd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:48:42, skipping insertion in model container [2025-03-16 22:48:42,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:48:40" (2/3) ... [2025-03-16 22:48:42,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a1cd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:48:42, skipping insertion in model container [2025-03-16 22:48:42,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:48:42" (3/3) ... [2025-03-16 22:48:42,718 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-16 22:48:42,729 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:48:42,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:48:42,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:48:42,767 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;@4db3f4db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:48:42,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:48:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:48:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:48:42,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:42,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:48:42,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:42,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:48:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:48:42,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625969819] [2025-03-16 22:48:42,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:42,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:42,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:48:42,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:48:42,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:48:43,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:48:43,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:48:43,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:43,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:43,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 22:48:43,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:48:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:43,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:48:43,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:48:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625969819] [2025-03-16 22:48:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625969819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:48:43,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:48:43,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:48:43,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185911282] [2025-03-16 22:48:43,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:48:43,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:48:43,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:48:43,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:48:43,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:48:43,244 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2025-03-16 22:48:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:43,361 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-03-16 22:48:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:48:43,363 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 [2025-03-16 22:48:43,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:43,367 INFO L225 Difference]: With dead ends: 15 [2025-03-16 22:48:43,367 INFO L226 Difference]: Without dead ends: 8 [2025-03-16 22:48:43,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:48:43,370 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:43,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:48:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-03-16 22:48:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-16 22:48:43,387 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) [2025-03-16 22:48:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:48:43,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:48:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:43,390 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:48:43,390 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) [2025-03-16 22:48:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:48:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:48:43,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:43,391 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:48:43,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:48:43,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:43,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:43,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:48:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:48:43,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029245017] [2025-03-16 22:48:43,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:43,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:43,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:48:43,597 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:48:43,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 22:48:43,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:48:44,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:48:44,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:44,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:44,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 22:48:44,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:48:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:44,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:48:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:44,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:48:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029245017] [2025-03-16 22:48:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029245017] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:48:44,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:48:44,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 22:48:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813385754] [2025-03-16 22:48:44,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:48:44,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:48:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:48:44,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:48:44,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:48:44,637 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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) [2025-03-16 22:48:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:44,909 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-16 22:48:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:48:44,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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 [2025-03-16 22:48:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:44,910 INFO L225 Difference]: With dead ends: 13 [2025-03-16 22:48:44,910 INFO L226 Difference]: Without dead ends: 11 [2025-03-16 22:48:44,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:48:44,910 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:44,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:48:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-16 22:48:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-16 22:48:44,912 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) [2025-03-16 22:48:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 22:48:44,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 22:48:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:44,912 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 22:48:44,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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) [2025-03-16 22:48:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 22:48:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 22:48:44,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:44,913 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 22:48:44,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 22:48:45,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:45,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 22:48:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:48:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098690721] [2025-03-16 22:48:45,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:48:45,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:45,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:48:45,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:48:45,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 22:48:45,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 22:48:45,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 22:48:45,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:48:45,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:45,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 22:48:45,643 INFO L279 TraceCheckSpWp]: Computing forward predicates...