./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.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 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:59:41,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:59:41,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 11:59:41,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:59:41,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:59:41,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:59:41,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:59:41,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:59:41,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:59:41,522 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:59:41,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:59:41,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:59:41,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:59:41,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:59:41,523 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:59:41,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:59:41,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:59:41,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 11:59:41,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:59:41,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:59:41,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:59:41,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:59:41,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:59:41,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:59:41,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:59:41,529 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:59:41,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:59:41,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:59:41,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:59:41,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:59:41,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:59:41,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:59:41,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:59:41,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 11:59:41,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 11:59:41,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:59:41,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:59:41,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:59:41,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:59:41,531 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 [2024-11-16 11:59:41,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:59:41,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:59:41,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:59:41,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:59:41,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:59:41,783 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_vsaR_p14.c [2024-11-16 11:59:43,018 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:59:43,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:59:43,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-16 11:59:43,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8a61e7bb/87be6fd1aefc4713a46281154bfb531a/FLAG6929affe3 [2024-11-16 11:59:43,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8a61e7bb/87be6fd1aefc4713a46281154bfb531a [2024-11-16 11:59:43,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:59:43,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:59:43,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:59:43,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:59:43,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:59:43,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:43" (1/1) ... [2024-11-16 11:59:43,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b341f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:43, skipping insertion in model container [2024-11-16 11:59:43,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:43" (1/1) ... [2024-11-16 11:59:43,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:59:43,817 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_vsaR_p14.c[1259,1272] [2024-11-16 11:59:44,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:59:44,060 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:59:44,070 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_vsaR_p14.c[1259,1272] [2024-11-16 11:59:44,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:59:44,159 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:59:44,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44 WrapperNode [2024-11-16 11:59:44,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:59:44,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:59:44,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:59:44,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:59:44,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,355 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2136 [2024-11-16 11:59:44,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:59:44,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:59:44,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:59:44,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:59:44,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,480 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 11:59:44,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:59:44,680 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:59:44,680 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:59:44,680 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:59:44,681 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (1/1) ... [2024-11-16 11:59:44,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:59:44,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:59:44,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 11:59:44,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 11:59:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:59:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 11:59:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:59:44,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:59:45,011 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:59:45,012 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:59:46,589 INFO L? ?]: Removed 1339 outVars from TransFormulas that were not future-live. [2024-11-16 11:59:46,589 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:59:46,688 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:59:46,692 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:59:46,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:46 BoogieIcfgContainer [2024-11-16 11:59:46,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:59:46,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:59:46,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:59:46,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:59:46,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:59:43" (1/3) ... [2024-11-16 11:59:46,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2935b5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:46, skipping insertion in model container [2024-11-16 11:59:46,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:44" (2/3) ... [2024-11-16 11:59:46,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2935b5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:46, skipping insertion in model container [2024-11-16 11:59:46,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:46" (3/3) ... [2024-11-16 11:59:46,702 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-16 11:59:46,716 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:59:46,717 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:59:46,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:59:46,801 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;@1766a581, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:59:46,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:59:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 542 states, 540 states have (on average 1.4962962962962962) internal successors, (808), 541 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 11:59:46,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:46,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:46,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:46,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 891316908, now seen corresponding path program 1 times [2024-11-16 11:59:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:46,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632778845] [2024-11-16 11:59:46,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:46,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632778845] [2024-11-16 11:59:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632778845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:47,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:59:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732830100] [2024-11-16 11:59:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:47,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:59:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:47,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:59:47,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:47,370 INFO L87 Difference]: Start difference. First operand has 542 states, 540 states have (on average 1.4962962962962962) internal successors, (808), 541 states have internal predecessors, (808), 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 11.0) 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) [2024-11-16 11:59:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:47,671 INFO L93 Difference]: Finished difference Result 1027 states and 1535 transitions. [2024-11-16 11:59:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:59:47,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) 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 [2024-11-16 11:59:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:47,688 INFO L225 Difference]: With dead ends: 1027 [2024-11-16 11:59:47,690 INFO L226 Difference]: Without dead ends: 539 [2024-11-16 11:59:47,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:47,699 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 0 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:47,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1999 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:59:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-16 11:59:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2024-11-16 11:59:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.4944237918215613) internal successors, (804), 538 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 804 transitions. [2024-11-16 11:59:47,755 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 804 transitions. Word has length 44 [2024-11-16 11:59:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:47,756 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 804 transitions. [2024-11-16 11:59:47,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) 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) [2024-11-16 11:59:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 804 transitions. [2024-11-16 11:59:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 11:59:47,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:47,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:47,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 11:59:47,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:47,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:47,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2006074542, now seen corresponding path program 1 times [2024-11-16 11:59:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:47,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499922729] [2024-11-16 11:59:47,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:47,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:47,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:47,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499922729] [2024-11-16 11:59:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499922729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:47,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:59:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649401008] [2024-11-16 11:59:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:47,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:59:47,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:47,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:59:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:47,988 INFO L87 Difference]: Start difference. First operand 539 states and 804 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:48,256 INFO L93 Difference]: Finished difference Result 1026 states and 1531 transitions. [2024-11-16 11:59:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:59:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2024-11-16 11:59:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:48,259 INFO L225 Difference]: With dead ends: 1026 [2024-11-16 11:59:48,260 INFO L226 Difference]: Without dead ends: 541 [2024-11-16 11:59:48,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:48,262 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 0 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:48,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1996 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:59:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-16 11:59:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2024-11-16 11:59:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.4925925925925927) internal successors, (806), 540 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 806 transitions. [2024-11-16 11:59:48,274 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 806 transitions. Word has length 45 [2024-11-16 11:59:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:48,275 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 806 transitions. [2024-11-16 11:59:48,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 806 transitions. [2024-11-16 11:59:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 11:59:48,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:48,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:48,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 11:59:48,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:48,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1806013009, now seen corresponding path program 1 times [2024-11-16 11:59:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495021026] [2024-11-16 11:59:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:48,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:48,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495021026] [2024-11-16 11:59:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495021026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:48,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:48,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:59:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287776342] [2024-11-16 11:59:48,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:48,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:59:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:59:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:59:48,630 INFO L87 Difference]: Start difference. First operand 541 states and 806 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:49,018 INFO L93 Difference]: Finished difference Result 1032 states and 1538 transitions. [2024-11-16 11:59:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:59:49,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 46 [2024-11-16 11:59:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:49,020 INFO L225 Difference]: With dead ends: 1032 [2024-11-16 11:59:49,020 INFO L226 Difference]: Without dead ends: 545 [2024-11-16 11:59:49,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:59:49,022 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 773 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:49,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2637 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:59:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-16 11:59:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 544. [2024-11-16 11:59:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4898710865561695) internal successors, (809), 543 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 809 transitions. [2024-11-16 11:59:49,030 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 809 transitions. Word has length 46 [2024-11-16 11:59:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:49,030 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 809 transitions. [2024-11-16 11:59:49,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 809 transitions. [2024-11-16 11:59:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 11:59:49,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:49,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:49,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 11:59:49,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:49,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1913552854, now seen corresponding path program 1 times [2024-11-16 11:59:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:49,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146239697] [2024-11-16 11:59:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:49,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146239697] [2024-11-16 11:59:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146239697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:49,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:49,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:59:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045259521] [2024-11-16 11:59:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:49,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:59:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:49,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:59:49,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:49,255 INFO L87 Difference]: Start difference. First operand 544 states and 809 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:49,505 INFO L93 Difference]: Finished difference Result 1038 states and 1544 transitions. [2024-11-16 11:59:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:59:49,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-16 11:59:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:49,507 INFO L225 Difference]: With dead ends: 1038 [2024-11-16 11:59:49,507 INFO L226 Difference]: Without dead ends: 548 [2024-11-16 11:59:49,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:49,509 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 2 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:49,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1992 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:59:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-16 11:59:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2024-11-16 11:59:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.4880733944954128) internal successors, (811), 545 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 811 transitions. [2024-11-16 11:59:49,518 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 811 transitions. Word has length 47 [2024-11-16 11:59:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:49,518 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 811 transitions. [2024-11-16 11:59:49,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 811 transitions. [2024-11-16 11:59:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 11:59:49,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:49,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:49,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 11:59:49,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:49,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1438475383, now seen corresponding path program 1 times [2024-11-16 11:59:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:49,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30022773] [2024-11-16 11:59:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:49,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:49,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30022773] [2024-11-16 11:59:49,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30022773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:49,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:49,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:59:49,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066019735] [2024-11-16 11:59:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:49,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:59:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:49,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:59:49,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:59:49,730 INFO L87 Difference]: Start difference. First operand 546 states and 811 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:50,056 INFO L93 Difference]: Finished difference Result 1042 states and 1548 transitions. [2024-11-16 11:59:50,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:59:50,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 47 [2024-11-16 11:59:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:50,059 INFO L225 Difference]: With dead ends: 1042 [2024-11-16 11:59:50,059 INFO L226 Difference]: Without dead ends: 550 [2024-11-16 11:59:50,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:59:50,061 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 1 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3312 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:50,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3312 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:59:50,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-16 11:59:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 549. [2024-11-16 11:59:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4872262773722629) internal successors, (815), 548 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 815 transitions. [2024-11-16 11:59:50,072 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 815 transitions. Word has length 47 [2024-11-16 11:59:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:50,073 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 815 transitions. [2024-11-16 11:59:50,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 815 transitions. [2024-11-16 11:59:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 11:59:50,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:50,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:50,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 11:59:50,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:50,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1231185179, now seen corresponding path program 1 times [2024-11-16 11:59:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690379135] [2024-11-16 11:59:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:50,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690379135] [2024-11-16 11:59:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690379135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:50,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 11:59:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065226064] [2024-11-16 11:59:50,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:50,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:59:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:50,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:59:50,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:59:50,421 INFO L87 Difference]: Start difference. First operand 549 states and 815 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:50,882 INFO L93 Difference]: Finished difference Result 1049 states and 1557 transitions. [2024-11-16 11:59:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:59:50,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 48 [2024-11-16 11:59:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:50,884 INFO L225 Difference]: With dead ends: 1049 [2024-11-16 11:59:50,884 INFO L226 Difference]: Without dead ends: 554 [2024-11-16 11:59:50,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:59:50,886 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 772 mSDsluCounter, 3292 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 3954 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:50,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 3954 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:59:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-16 11:59:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2024-11-16 11:59:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.486388384754991) internal successors, (819), 551 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 819 transitions. [2024-11-16 11:59:50,896 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 819 transitions. Word has length 48 [2024-11-16 11:59:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:50,897 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 819 transitions. [2024-11-16 11:59:50,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 819 transitions. [2024-11-16 11:59:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 11:59:50,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:50,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:50,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 11:59:50,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:50,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1899256425, now seen corresponding path program 1 times [2024-11-16 11:59:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:50,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098416246] [2024-11-16 11:59:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:51,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:59:51,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098416246] [2024-11-16 11:59:51,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098416246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:51,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:51,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:59:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683694625] [2024-11-16 11:59:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:51,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:59:51,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:59:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:59:51,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:59:51,147 INFO L87 Difference]: Start difference. First operand 552 states and 819 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:51,552 INFO L93 Difference]: Finished difference Result 1245 states and 1843 transitions. [2024-11-16 11:59:51,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:59:51,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 48 [2024-11-16 11:59:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:51,555 INFO L225 Difference]: With dead ends: 1245 [2024-11-16 11:59:51,555 INFO L226 Difference]: Without dead ends: 747 [2024-11-16 11:59:51,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:59:51,556 INFO L432 NwaCegarLoop]: 651 mSDtfsCounter, 1338 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 2598 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:51,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 2598 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:59:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-11-16 11:59:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 562. [2024-11-16 11:59:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.4848484848484849) internal successors, (833), 561 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 833 transitions. [2024-11-16 11:59:51,566 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 833 transitions. Word has length 48 [2024-11-16 11:59:51,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:51,566 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 833 transitions. [2024-11-16 11:59:51,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 833 transitions. [2024-11-16 11:59:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 11:59:51,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:51,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:51,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 11:59:51,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:51,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1741620896, now seen corresponding path program 1 times [2024-11-16 11:59:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:59:51,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14183661] [2024-11-16 11:59:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:51,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:59:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:59:51,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:59:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:59:51,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 11:59:51,706 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:59:51,707 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:59:51,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 11:59:51,712 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:51,772 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:59:51,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:59:51 BoogieIcfgContainer [2024-11-16 11:59:51,776 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:59:51,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:59:51,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:59:51,777 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:59:51,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:46" (3/4) ... [2024-11-16 11:59:51,779 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 11:59:51,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:59:51,781 INFO L158 Benchmark]: Toolchain (without parser) took 8195.57ms. Allocated memory was 188.7MB in the beginning and 507.5MB in the end (delta: 318.8MB). Free memory was 115.0MB in the beginning and 405.0MB in the end (delta: -289.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-16 11:59:51,781 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:59:51,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.30ms. Allocated memory is still 188.7MB. Free memory was 114.9MB in the beginning and 119.0MB in the end (delta: -4.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-16 11:59:51,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 195.51ms. Allocated memory is still 188.7MB. Free memory was 119.0MB in the beginning and 69.4MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-16 11:59:51,782 INFO L158 Benchmark]: Boogie Preprocessor took 322.29ms. Allocated memory is still 188.7MB. Free memory was 69.4MB in the beginning and 119.8MB in the end (delta: -50.4MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2024-11-16 11:59:51,782 INFO L158 Benchmark]: IcfgBuilder took 2012.84ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 119.1MB in the beginning and 180.6MB in the end (delta: -61.5MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. [2024-11-16 11:59:51,782 INFO L158 Benchmark]: TraceAbstraction took 5081.97ms. Allocated memory was 327.2MB in the beginning and 507.5MB in the end (delta: 180.4MB). Free memory was 180.6MB in the beginning and 406.0MB in the end (delta: -225.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:59:51,783 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 507.5MB. Free memory was 406.0MB in the beginning and 405.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:59:51,784 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.17ms. Allocated memory is still 109.1MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.30ms. Allocated memory is still 188.7MB. Free memory was 114.9MB in the beginning and 119.0MB in the end (delta: -4.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 195.51ms. Allocated memory is still 188.7MB. Free memory was 119.0MB in the beginning and 69.4MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 322.29ms. Allocated memory is still 188.7MB. Free memory was 69.4MB in the beginning and 119.8MB in the end (delta: -50.4MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * IcfgBuilder took 2012.84ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 119.1MB in the beginning and 180.6MB in the end (delta: -61.5MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5081.97ms. Allocated memory was 327.2MB in the beginning and 507.5MB in the end (delta: 180.4MB). Free memory was 180.6MB in the beginning and 406.0MB in the end (delta: -225.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 507.5MB. Free memory was 406.0MB in the beginning and 405.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 171, overapproximation of bitwiseAnd at line 176. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_78 mask_SORT_78 = (SORT_78)-1 >> (sizeof(SORT_78) * 8 - 32); [L39] const SORT_78 msb_SORT_78 = (SORT_78)1 << (32 - 1); [L41] const SORT_107 mask_SORT_107 = (SORT_107)-1 >> (sizeof(SORT_107) * 8 - 4); [L42] const SORT_107 msb_SORT_107 = (SORT_107)1 << (4 - 1); [L44] const SORT_174 mask_SORT_174 = (SORT_174)-1 >> (sizeof(SORT_174) * 8 - 2); [L45] const SORT_174 msb_SORT_174 = (SORT_174)1 << (2 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_5 var_12 = 0; [L49] const SORT_7 var_16 = 2; [L50] const SORT_1 var_19 = 0; [L51] const SORT_3 var_26 = 0; [L52] const SORT_1 var_35 = 1; [L53] const SORT_7 var_57 = 1; [L54] const SORT_7 var_62 = 4; [L55] const SORT_7 var_64 = 5; [L56] const SORT_7 var_68 = 3; [L57] const SORT_78 var_80 = 0; [L58] const SORT_3 var_94 = 2; [L59] const SORT_7 var_124 = 7; [L60] const SORT_7 var_129 = 6; [L61] const SORT_3 var_183 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_171; [L67] SORT_3 input_172; [L68] SORT_3 input_173; [L69] SORT_3 input_182; [L70] SORT_3 input_192; [L71] SORT_3 input_193; [L72] SORT_3 input_194; [L73] SORT_3 input_197; [L74] SORT_3 input_216; [L75] SORT_3 input_217; [L76] SORT_3 input_218; [L77] SORT_3 input_221; [L78] SORT_3 input_223; [L79] SORT_174 input_237; [L80] SORT_174 input_238; [L81] SORT_174 input_239; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L84] SORT_5 state_13 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L85] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L86] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L87] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L89] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L90] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L91] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L92] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L93] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L94] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L95] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_5 init_14_arg_1 = var_12; [L100] state_13 = init_14_arg_1 [L101] SORT_1 init_21_arg_1 = var_19; [L102] state_20 = init_21_arg_1 [L103] SORT_3 init_28_arg_1 = var_26; [L104] state_27 = init_28_arg_1 [L105] SORT_3 init_30_arg_1 = var_26; [L106] state_29 = init_30_arg_1 [L107] SORT_3 init_40_arg_1 = var_26; [L108] state_39 = init_40_arg_1 [L109] SORT_3 init_42_arg_1 = var_26; [L110] state_41 = init_42_arg_1 [L111] SORT_3 init_44_arg_1 = var_26; [L112] state_43 = init_44_arg_1 [L113] SORT_3 init_46_arg_1 = var_26; [L114] state_45 = init_46_arg_1 [L115] SORT_3 init_48_arg_1 = var_26; [L116] state_47 = init_48_arg_1 [L117] SORT_3 init_50_arg_1 = var_26; [L118] state_49 = init_50_arg_1 [L119] SORT_3 init_52_arg_1 = var_26; [L120] state_51 = init_52_arg_1 [L121] SORT_3 init_54_arg_1 = var_26; [L122] state_53 = init_54_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_171 = __VERIFIER_nondet_uchar() [L129] input_172 = __VERIFIER_nondet_uchar() [L130] input_173 = __VERIFIER_nondet_uchar() [L131] input_182 = __VERIFIER_nondet_uchar() [L132] input_192 = __VERIFIER_nondet_uchar() [L133] input_193 = __VERIFIER_nondet_uchar() [L134] input_194 = __VERIFIER_nondet_uchar() [L135] input_197 = __VERIFIER_nondet_uchar() [L136] input_216 = __VERIFIER_nondet_uchar() [L137] input_217 = __VERIFIER_nondet_uchar() [L138] input_218 = __VERIFIER_nondet_uchar() [L139] input_221 = __VERIFIER_nondet_uchar() [L140] input_223 = __VERIFIER_nondet_uchar() [L141] input_237 = __VERIFIER_nondet_uchar() [L142] input_238 = __VERIFIER_nondet_uchar() [L143] input_239 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 2; [L148] SORT_5 var_15_arg_0 = state_13; [L149] SORT_7 var_15 = var_15_arg_0 >> 9; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L150] EXPR var_15 & mask_SORT_7 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L150] var_15 = var_15 & mask_SORT_7 [L151] SORT_7 var_17_arg_0 = var_15; [L152] SORT_7 var_17_arg_1 = var_16; [L153] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L154] SORT_1 var_18_arg_0 = var_17; [L155] SORT_1 var_18 = ~var_18_arg_0; [L156] SORT_1 var_22_arg_0 = state_20; [L157] SORT_1 var_22 = ~var_22_arg_0; [L158] SORT_1 var_23_arg_0 = var_18; [L159] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_23_arg_0=-1, var_23_arg_1=-1, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L160] EXPR var_23_arg_0 | var_23_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L160] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L161] SORT_1 var_24_arg_0 = var_11; [L162] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_24_arg_0=0, var_24_arg_1=255, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L163] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L163] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L164] SORT_1 var_25_arg_0 = var_24; [L165] SORT_1 var_25 = ~var_25_arg_0; [L166] SORT_3 var_31_arg_0 = state_27; [L167] SORT_3 var_31_arg_1 = state_29; [L168] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L169] SORT_1 var_32_arg_0 = var_25; [L170] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_32_arg_0=-1, var_32_arg_1=1, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L171] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L171] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L172] SORT_1 var_36_arg_0 = var_32; [L173] SORT_1 var_36 = ~var_36_arg_0; [L174] SORT_1 var_37_arg_0 = var_35; [L175] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_37_arg_0=1, var_37_arg_1=-1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L176] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L176] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L177] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L177] var_37 = var_37 & mask_SORT_1 [L178] SORT_1 bad_38_arg_0 = var_37; [L179] CALL __VERIFIER_assert(!(bad_38_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 542 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2886 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2886 mSDsluCounter, 18488 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13847 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3974 IncrementalHoareTripleChecker+Invalid, 3976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 4641 mSDtfsCounter, 3974 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 191 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 722 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 11:59:51,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.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 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:59:53,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:59:53,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 11:59:53,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:59:53,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:59:53,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:59:53,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:59:53,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:59:53,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:59:53,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:59:53,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:59:53,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:59:53,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:59:53,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:59:53,812 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:59:53,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:59:53,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:59:53,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:59:53,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:59:53,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:59:53,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:59:53,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 11:59:53,814 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 11:59:53,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:59:53,815 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 11:59:53,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:59:53,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:59:53,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:59:53,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:59:53,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:59:53,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:59:53,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:59:53,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:59:53,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:59:53,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:59:53,819 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 11:59:53,819 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 11:59:53,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:59:53,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:59:53,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:59:53,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:59:53,820 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 [2024-11-16 11:59:54,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:59:54,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:59:54,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:59:54,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:59:54,135 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:59:54,136 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_vsaR_p14.c [2024-11-16 11:59:55,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:59:55,627 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:59:55,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-16 11:59:55,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900cf11da/a262524005d44558b930e5c7256118a9/FLAG7887e1a42 [2024-11-16 11:59:55,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900cf11da/a262524005d44558b930e5c7256118a9 [2024-11-16 11:59:55,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:59:55,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:59:55,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:59:55,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:59:55,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:59:55,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:55" (1/1) ... [2024-11-16 11:59:55,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fea04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:55, skipping insertion in model container [2024-11-16 11:59:55,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:55" (1/1) ... [2024-11-16 11:59:56,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:59:56,210 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_vsaR_p14.c[1259,1272] [2024-11-16 11:59:56,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:59:56,412 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:59:56,420 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_vsaR_p14.c[1259,1272] [2024-11-16 11:59:56,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:59:56,521 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:59:56,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56 WrapperNode [2024-11-16 11:59:56,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:59:56,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:59:56,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:59:56,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:59:56,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,606 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1078 [2024-11-16 11:59:56,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:59:56,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:59:56,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:59:56,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:59:56,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,672 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 11:59:56,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:59:56,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:59:56,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:59:56,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:59:56,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (1/1) ... [2024-11-16 11:59:56,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:59:56,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:59:56,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 11:59:56,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 11:59:56,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:59:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 11:59:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:59:56,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:59:57,047 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:59:57,049 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:59:58,302 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-16 11:59:58,303 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:59:58,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:59:58,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:59:58,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:58 BoogieIcfgContainer [2024-11-16 11:59:58,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:59:58,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:59:58,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:59:58,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:59:58,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:59:55" (1/3) ... [2024-11-16 11:59:58,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2bbbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:58, skipping insertion in model container [2024-11-16 11:59:58,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:56" (2/3) ... [2024-11-16 11:59:58,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2bbbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:58, skipping insertion in model container [2024-11-16 11:59:58,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:58" (3/3) ... [2024-11-16 11:59:58,322 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-16 11:59:58,335 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:59:58,336 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:59:58,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:59:58,388 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;@921d2e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:59:58,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:59:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 11:59:58,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:58,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 11:59:58,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:58,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 11:59:58,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:59:58,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378783311] [2024-11-16 11:59:58,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:58,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 11:59:58,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:59:58,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 11:59:58,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 11:59:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:58,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 11:59:58,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:59:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:58,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:59:58,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:59:58,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378783311] [2024-11-16 11:59:58,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378783311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:59:58,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:59:58,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:59:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138579415] [2024-11-16 11:59:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:59:58,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:59:58,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:59:58,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:59:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:59:58,808 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:58,880 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 11:59:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:59:58,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-16 11:59:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:58,889 INFO L225 Difference]: With dead ends: 22 [2024-11-16 11:59:58,889 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 11:59:58,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:59:58,896 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:58,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 11:59:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 11:59:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 11:59:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 11:59:58,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 11:59:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:58,927 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 11:59:58,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 11:59:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 11:59:58,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:58,928 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:59:58,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 11:59:59,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 11:59:59,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:59:59,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:59:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 11:59:59,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:59:59,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261102663] [2024-11-16 11:59:59,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:59:59,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 11:59:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:59:59,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 11:59:59,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 11:59:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:59:59,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 11:59:59,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:59:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:59,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:59:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:59:59,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:59:59,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261102663] [2024-11-16 11:59:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261102663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:59:59,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:59:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 11:59:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88773585] [2024-11-16 11:59:59,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 11:59:59,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:59:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:59:59,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:59:59,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:59:59,750 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:59:59,977 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-16 11:59:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:59:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 9 [2024-11-16 11:59:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:59:59,978 INFO L225 Difference]: With dead ends: 20 [2024-11-16 11:59:59,978 INFO L226 Difference]: Without dead ends: 17 [2024-11-16 11:59:59,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 11:59:59,979 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:59:59,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:59:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-16 11:59:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-16 11:59:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-16 11:59:59,985 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2024-11-16 11:59:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:59:59,985 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-16 11:59:59,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:59:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-16 11:59:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 11:59:59,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:59:59,987 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-16 11:59:59,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 12:00:00,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:00,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:00,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 2 times [2024-11-16 12:00:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:00,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53748943] [2024-11-16 12:00:00,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 12:00:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:00,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:00,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:00,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 12:00:00,869 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 12:00:00,869 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 12:00:00,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 12:00:00,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:01,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:00:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:02,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53748943] [2024-11-16 12:00:02,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53748943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:00:02,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:00:02,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-16 12:00:02,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987098438] [2024-11-16 12:00:02,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:00:02,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:00:02,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:02,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:00:02,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:00:02,062 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:03,062 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-11-16 12:00:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 12:00:03,062 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 12:00:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:03,063 INFO L225 Difference]: With dead ends: 35 [2024-11-16 12:00:03,063 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 12:00:03,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-16 12:00:03,064 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:03,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:00:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 12:00:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-16 12:00:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-11-16 12:00:03,071 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2024-11-16 12:00:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:03,071 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-16 12:00:03,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-11-16 12:00:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 12:00:03,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:03,072 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2024-11-16 12:00:03,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 12:00:03,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:03,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:03,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1651905795, now seen corresponding path program 3 times [2024-11-16 12:00:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:03,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341443304] [2024-11-16 12:00:03,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 12:00:03,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:03,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:03,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:03,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 12:00:03,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-16 12:00:03,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 12:00:03,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-16 12:00:03,739 INFO L278 TraceCheckSpWp]: Computing forward predicates...