./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.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 c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:56:58,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:56:58,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:56:58,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:56:58,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:56:58,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:56:58,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:56:58,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:56:58,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:56:58,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:56:58,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:56:58,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:56:58,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:56:58,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:56:58,620 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:56:58,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:56:58,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:56:58,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:56:58,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:56:58,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:56:58,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:56:58,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:56:58,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:56:58,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:56:58,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:56:58,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:56:58,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:56:58,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:56:58,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:56:58,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:56:58,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:56:58,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:56:58,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:56:58,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:56:58,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:56:58,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:56:58,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:56:58,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:56:58,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:56:58,627 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 -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2024-11-12 00:56:58,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:56:58,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:56:58,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:56:58,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:56:58,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:56:58,859 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_p02.c [2024-11-12 00:57:00,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:57:00,283 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:57:00,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-12 00:57:00,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175593a61/1251f7f7caeb439c92d8bb119d7a4948/FLAG15445b6b2 [2024-11-12 00:57:00,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175593a61/1251f7f7caeb439c92d8bb119d7a4948 [2024-11-12 00:57:00,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:57:00,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:57:00,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:00,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:57:00,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:57:00,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:00" (1/1) ... [2024-11-12 00:57:00,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68c95ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:00, skipping insertion in model container [2024-11-12 00:57:00,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:00" (1/1) ... [2024-11-12 00:57:00,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:57:00,895 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_p02.c[1259,1272] [2024-11-12 00:57:01,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:01,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:57:01,156 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_p02.c[1259,1272] [2024-11-12 00:57:01,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:01,287 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:57:01,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01 WrapperNode [2024-11-12 00:57:01,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:01,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:01,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:57:01,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:57:01,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,473 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2114 [2024-11-12 00:57:01,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:01,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:57:01,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:57:01,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:57:01,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,591 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-12 00:57:01,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:57:01,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:57:01,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:57:01,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:57:01,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (1/1) ... [2024-11-12 00:57:01,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:01,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:57:01,744 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-12 00:57:01,746 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-12 00:57:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:57:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:57:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:57:01,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:57:02,137 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:57:02,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:57:03,765 INFO L? ?]: Removed 1324 outVars from TransFormulas that were not future-live. [2024-11-12 00:57:03,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:57:03,789 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:57:03,791 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:57:03,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:03 BoogieIcfgContainer [2024-11-12 00:57:03,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:57:03,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:57:03,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:57:03,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:57:03,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:57:00" (1/3) ... [2024-11-12 00:57:03,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773c7bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:03, skipping insertion in model container [2024-11-12 00:57:03,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:01" (2/3) ... [2024-11-12 00:57:03,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773c7bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:03, skipping insertion in model container [2024-11-12 00:57:03,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:03" (3/3) ... [2024-11-12 00:57:03,798 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-12 00:57:03,811 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:57:03,812 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:57:03,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:57:03,882 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;@4abb356d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:57:03,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:57:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 531 states, 529 states have (on average 1.4990548204158791) internal successors, (793), 530 states have internal predecessors, (793), 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-12 00:57:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 00:57:03,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:03,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:03,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 387884158, now seen corresponding path program 1 times [2024-11-12 00:57:03,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:03,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297212667] [2024-11-12 00:57:03,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:03,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:04,395 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-12 00:57:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297212667] [2024-11-12 00:57:04,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297212667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:04,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:04,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:57:04,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124411611] [2024-11-12 00:57:04,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:04,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:57:04,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:57:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:04,424 INFO L87 Difference]: Start difference. First operand has 531 states, 529 states have (on average 1.4990548204158791) internal successors, (793), 530 states have internal predecessors, (793), 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 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:04,500 INFO L93 Difference]: Finished difference Result 1007 states and 1507 transitions. [2024-11-12 00:57:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:57:04,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-12 00:57:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:04,516 INFO L225 Difference]: With dead ends: 1007 [2024-11-12 00:57:04,517 INFO L226 Difference]: Without dead ends: 530 [2024-11-12 00:57:04,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:04,523 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 0 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:04,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2355 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-12 00:57:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2024-11-12 00:57:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.4952741020793952) internal successors, (791), 529 states have internal predecessors, (791), 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-12 00:57:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 791 transitions. [2024-11-12 00:57:04,586 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 791 transitions. Word has length 41 [2024-11-12 00:57:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:04,586 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 791 transitions. [2024-11-12 00:57:04,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 791 transitions. [2024-11-12 00:57:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 00:57:04,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:04,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:04,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:57:04,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:04,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:04,589 INFO L85 PathProgramCache]: Analyzing trace with hash -858797603, now seen corresponding path program 1 times [2024-11-12 00:57:04,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:04,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389694036] [2024-11-12 00:57:04,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:04,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:04,742 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-12 00:57:04,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:04,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389694036] [2024-11-12 00:57:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389694036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:04,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:04,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:57:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754923310] [2024-11-12 00:57:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:57:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:57:04,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:04,749 INFO L87 Difference]: Start difference. First operand 530 states and 791 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:04,782 INFO L93 Difference]: Finished difference Result 1008 states and 1505 transitions. [2024-11-12 00:57:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:57:04,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-12 00:57:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:04,785 INFO L225 Difference]: With dead ends: 1008 [2024-11-12 00:57:04,786 INFO L226 Difference]: Without dead ends: 532 [2024-11-12 00:57:04,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:04,789 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 0 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:04,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2351 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-12 00:57:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2024-11-12 00:57:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4934086629001884) internal successors, (793), 531 states have internal predecessors, (793), 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-12 00:57:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 793 transitions. [2024-11-12 00:57:04,801 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 793 transitions. Word has length 42 [2024-11-12 00:57:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:04,801 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 793 transitions. [2024-11-12 00:57:04,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 793 transitions. [2024-11-12 00:57:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-12 00:57:04,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:04,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:04,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:57:04,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:04,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1950887625, now seen corresponding path program 1 times [2024-11-12 00:57:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:04,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749658924] [2024-11-12 00:57:04,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:05,048 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-12 00:57:05,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:05,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749658924] [2024-11-12 00:57:05,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749658924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:05,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:05,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:05,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831200955] [2024-11-12 00:57:05,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:05,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:05,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:05,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:05,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:05,050 INFO L87 Difference]: Start difference. First operand 532 states and 793 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:05,094 INFO L93 Difference]: Finished difference Result 1014 states and 1512 transitions. [2024-11-12 00:57:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:57:05,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-12 00:57:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:05,096 INFO L225 Difference]: With dead ends: 1014 [2024-11-12 00:57:05,096 INFO L226 Difference]: Without dead ends: 536 [2024-11-12 00:57:05,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:57:05,098 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 760 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:05,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 2342 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-12 00:57:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 535. [2024-11-12 00:57:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4906367041198503) internal successors, (796), 534 states have internal predecessors, (796), 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-12 00:57:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 796 transitions. [2024-11-12 00:57:05,116 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 796 transitions. Word has length 43 [2024-11-12 00:57:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:05,116 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 796 transitions. [2024-11-12 00:57:05,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 796 transitions. [2024-11-12 00:57:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 00:57:05,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:05,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:05,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:57:05,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1216571104, now seen corresponding path program 1 times [2024-11-12 00:57:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689042709] [2024-11-12 00:57:05,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:05,638 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-12 00:57:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689042709] [2024-11-12 00:57:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689042709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:05,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:05,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:57:05,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765698307] [2024-11-12 00:57:05,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:05,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:57:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:05,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:57:05,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:57:05,641 INFO L87 Difference]: Start difference. First operand 535 states and 796 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-12 00:57:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:05,722 INFO L93 Difference]: Finished difference Result 1025 states and 1525 transitions. [2024-11-12 00:57:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:57:05,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-12 00:57:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:05,726 INFO L225 Difference]: With dead ends: 1025 [2024-11-12 00:57:05,726 INFO L226 Difference]: Without dead ends: 544 [2024-11-12 00:57:05,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:57:05,727 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 771 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:05,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 3106 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-12 00:57:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 539. [2024-11-12 00:57:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.4888475836431228) internal successors, (801), 538 states have internal predecessors, (801), 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-12 00:57:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 801 transitions. [2024-11-12 00:57:05,736 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 801 transitions. Word has length 44 [2024-11-12 00:57:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:05,736 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 801 transitions. [2024-11-12 00:57:05,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-12 00:57:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 801 transitions. [2024-11-12 00:57:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 00:57:05,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:05,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:05,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:57:05,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:05,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:05,741 INFO L85 PathProgramCache]: Analyzing trace with hash 560912804, now seen corresponding path program 1 times [2024-11-12 00:57:05,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:05,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69840595] [2024-11-12 00:57:05,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:05,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:06,004 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-12 00:57:06,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:06,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69840595] [2024-11-12 00:57:06,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69840595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:06,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:06,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:57:06,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482582942] [2024-11-12 00:57:06,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:06,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:57:06,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:06,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:57:06,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:57:06,009 INFO L87 Difference]: Start difference. First operand 539 states and 801 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-12 00:57:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:06,076 INFO L93 Difference]: Finished difference Result 1022 states and 1520 transitions. [2024-11-12 00:57:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:57:06,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-12 00:57:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:06,078 INFO L225 Difference]: With dead ends: 1022 [2024-11-12 00:57:06,078 INFO L226 Difference]: Without dead ends: 537 [2024-11-12 00:57:06,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:57:06,080 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 751 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:06,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 3863 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-12 00:57:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 534. [2024-11-12 00:57:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.4896810506566605) internal successors, (794), 533 states have internal predecessors, (794), 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-12 00:57:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 794 transitions. [2024-11-12 00:57:06,089 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 794 transitions. Word has length 44 [2024-11-12 00:57:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:06,090 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 794 transitions. [2024-11-12 00:57:06,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-12 00:57:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 794 transitions. [2024-11-12 00:57:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 00:57:06,091 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:06,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:06,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:57:06,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:06,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1978279468, now seen corresponding path program 1 times [2024-11-12 00:57:06,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:06,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477544503] [2024-11-12 00:57:06,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:06,231 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-12 00:57:06,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:06,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477544503] [2024-11-12 00:57:06,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477544503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:06,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:06,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:06,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231644736] [2024-11-12 00:57:06,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:06,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:06,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:06,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:06,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:06,233 INFO L87 Difference]: Start difference. First operand 534 states and 794 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-12 00:57:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:06,630 INFO L93 Difference]: Finished difference Result 1108 states and 1643 transitions. [2024-11-12 00:57:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:57:06,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-12 00:57:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:06,632 INFO L225 Difference]: With dead ends: 1108 [2024-11-12 00:57:06,632 INFO L226 Difference]: Without dead ends: 628 [2024-11-12 00:57:06,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:57:06,634 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 1011 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:06,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1782 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 00:57:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-12 00:57:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 542. [2024-11-12 00:57:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4861367837338262) internal successors, (804), 541 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-12 00:57:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 804 transitions. [2024-11-12 00:57:06,642 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 804 transitions. Word has length 45 [2024-11-12 00:57:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:06,642 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 804 transitions. [2024-11-12 00:57:06,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-12 00:57:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 804 transitions. [2024-11-12 00:57:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 00:57:06,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:06,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:06,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:57:06,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1772973075, now seen corresponding path program 1 times [2024-11-12 00:57:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465214246] [2024-11-12 00:57:06,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:57:06,674 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 00:57:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:57:06,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 00:57:06,733 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 00:57:06,734 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:57:06,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:57:06,737 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:06,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:57:06,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:57:06 BoogieIcfgContainer [2024-11-12 00:57:06,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:57:06,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:57:06,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:57:06,793 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:57:06,794 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:03" (3/4) ... [2024-11-12 00:57:06,795 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 00:57:06,796 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:57:06,797 INFO L158 Benchmark]: Toolchain (without parser) took 6128.45ms. Allocated memory was 146.8MB in the beginning and 394.3MB in the end (delta: 247.5MB). Free memory was 92.8MB in the beginning and 123.1MB in the end (delta: -30.3MB). Peak memory consumption was 219.5MB. Max. memory is 16.1GB. [2024-11-12 00:57:06,797 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 146.8MB. Free memory was 114.0MB in the beginning and 114.0MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:57:06,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.35ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 92.8MB in the beginning and 137.9MB in the end (delta: -45.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2024-11-12 00:57:06,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 185.43ms. Allocated memory is still 188.7MB. Free memory was 137.9MB in the beginning and 89.6MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-12 00:57:06,797 INFO L158 Benchmark]: Boogie Preprocessor took 241.89ms. Allocated memory is still 188.7MB. Free memory was 89.6MB in the beginning and 60.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-12 00:57:06,798 INFO L158 Benchmark]: RCFGBuilder took 2075.04ms. Allocated memory was 188.7MB in the beginning and 314.6MB in the end (delta: 125.8MB). Free memory was 60.3MB in the beginning and 233.3MB in the end (delta: -173.1MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-11-12 00:57:06,798 INFO L158 Benchmark]: TraceAbstraction took 2998.59ms. Allocated memory was 314.6MB in the beginning and 394.3MB in the end (delta: 79.7MB). Free memory was 233.3MB in the beginning and 124.2MB in the end (delta: 109.2MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. [2024-11-12 00:57:06,799 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 394.3MB. Free memory was 124.2MB in the beginning and 123.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 00:57:06,800 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.09ms. Allocated memory is still 146.8MB. Free memory was 114.0MB in the beginning and 114.0MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.35ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 92.8MB in the beginning and 137.9MB in the end (delta: -45.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 185.43ms. Allocated memory is still 188.7MB. Free memory was 137.9MB in the beginning and 89.6MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 241.89ms. Allocated memory is still 188.7MB. Free memory was 89.6MB in the beginning and 60.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2075.04ms. Allocated memory was 188.7MB in the beginning and 314.6MB in the end (delta: 125.8MB). Free memory was 60.3MB in the beginning and 233.3MB in the end (delta: -173.1MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2998.59ms. Allocated memory was 314.6MB in the beginning and 394.3MB in the end (delta: 79.7MB). Free memory was 233.3MB in the beginning and 124.2MB in the end (delta: 109.2MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 394.3MB. Free memory was 124.2MB in the beginning and 123.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 165. 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_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 3); [L36] const SORT_45 msb_SORT_45 = (SORT_45)1 << (3 - 1); [L38] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 4); [L39] const SORT_86 msb_SORT_86 = (SORT_86)1 << (4 - 1); [L41] const SORT_143 mask_SORT_143 = (SORT_143)-1 >> (sizeof(SORT_143) * 8 - 32); [L42] const SORT_143 msb_SORT_143 = (SORT_143)1 << (32 - 1); [L44] const SORT_167 mask_SORT_167 = (SORT_167)-1 >> (sizeof(SORT_167) * 8 - 2); [L45] const SORT_167 msb_SORT_167 = (SORT_167)1 << (2 - 1); [L47] const SORT_3 var_7 = 0; [L48] const SORT_1 var_11 = 0; [L49] const SORT_1 var_20 = 1; [L50] const SORT_5 var_32 = 0; [L51] const SORT_45 var_46 = 0; [L52] const SORT_45 var_50 = 2; [L53] const SORT_45 var_54 = 1; [L54] const SORT_45 var_59 = 4; [L55] const SORT_45 var_61 = 5; [L56] const SORT_45 var_65 = 3; [L57] const SORT_3 var_73 = 2; [L58] const SORT_45 var_103 = 7; [L59] const SORT_45 var_108 = 6; [L60] const SORT_143 var_145 = 0; [L61] const SORT_3 var_176 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_164; [L67] SORT_3 input_165; [L68] SORT_3 input_166; [L69] SORT_3 input_175; [L70] SORT_3 input_185; [L71] SORT_3 input_186; [L72] SORT_3 input_187; [L73] SORT_3 input_190; [L74] SORT_3 input_209; [L75] SORT_3 input_210; [L76] SORT_3 input_211; [L77] SORT_3 input_214; [L78] SORT_3 input_216; [L79] SORT_167 input_230; [L80] SORT_167 input_231; [L81] SORT_167 input_232; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L83] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L84] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L85] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L86] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L87] SORT_3 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L88] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L89] SORT_5 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L90] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L91] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L92] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L93] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L94] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_45 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L95] SORT_45 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_45; [L97] SORT_3 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_3 init_14_arg_1 = var_7; [L100] state_13 = init_14_arg_1 [L101] SORT_3 init_25_arg_1 = var_7; [L102] state_24 = init_25_arg_1 [L103] SORT_3 init_27_arg_1 = var_7; [L104] state_26 = init_27_arg_1 [L105] SORT_3 init_29_arg_1 = var_7; [L106] state_28 = init_29_arg_1 [L107] SORT_1 init_31_arg_1 = var_11; [L108] state_30 = init_31_arg_1 [L109] SORT_5 init_34_arg_1 = var_32; [L110] state_33 = init_34_arg_1 [L111] SORT_3 init_36_arg_1 = var_7; [L112] state_35 = init_36_arg_1 [L113] SORT_3 init_38_arg_1 = var_7; [L114] state_37 = init_38_arg_1 [L115] SORT_3 init_40_arg_1 = var_7; [L116] state_39 = init_40_arg_1 [L117] SORT_3 init_42_arg_1 = var_7; [L118] state_41 = init_42_arg_1 [L119] SORT_3 init_44_arg_1 = var_7; [L120] state_43 = init_44_arg_1 [L121] SORT_45 init_48_arg_1 = var_46; [L122] state_47 = init_48_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_164 = __VERIFIER_nondet_uchar() [L129] input_165 = __VERIFIER_nondet_uchar() [L130] input_166 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_185 = __VERIFIER_nondet_uchar() [L133] input_186 = __VERIFIER_nondet_uchar() [L134] input_187 = __VERIFIER_nondet_uchar() [L135] input_190 = __VERIFIER_nondet_uchar() [L136] input_209 = __VERIFIER_nondet_uchar() [L137] input_210 = __VERIFIER_nondet_uchar() [L138] input_211 = __VERIFIER_nondet_uchar() [L139] input_214 = __VERIFIER_nondet_uchar() [L140] input_216 = __VERIFIER_nondet_uchar() [L141] input_230 = __VERIFIER_nondet_uchar() [L142] input_231 = __VERIFIER_nondet_uchar() [L143] input_232 = __VERIFIER_nondet_uchar() [L146] SORT_3 var_10_arg_0 = state_8; [L147] SORT_1 var_10 = var_10_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_10=0, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] EXPR var_10 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] var_10 = var_10 & mask_SORT_1 [L149] SORT_1 var_12_arg_0 = var_10; [L150] SORT_1 var_12_arg_1 = var_11; [L151] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L152] SORT_3 var_15_arg_0 = state_13; [L153] SORT_1 var_15 = var_15_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_15=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] var_15 = var_15 & mask_SORT_1 [L155] SORT_1 var_16_arg_0 = var_15; [L156] SORT_1 var_16_arg_1 = var_11; [L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L158] SORT_1 var_17_arg_0 = var_12; [L159] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_17_arg_0=1, var_17_arg_1=1, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L161] SORT_1 var_21_arg_0 = var_17; [L162] SORT_1 var_21 = ~var_21_arg_0; [L163] SORT_1 var_22_arg_0 = var_20; [L164] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_22_arg_0=1, var_22_arg_1=-2, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L166] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L166] var_22 = var_22 & mask_SORT_1 [L167] SORT_1 bad_23_arg_0 = var_22; [L168] CALL __VERIFIER_assert(!(bad_23_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 531 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3293 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3293 mSDsluCounter, 15799 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11294 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 4505 mSDtfsCounter, 743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542occurred in iteration=6, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 95 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-12 00:57:06,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.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 c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:57:08,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:57:08,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-12 00:57:08,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:57:08,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:57:08,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:57:08,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:57:08,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:57:08,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:57:08,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:57:08,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:57:08,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:57:08,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:57:08,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:57:08,777 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:57:08,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:57:08,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:57:08,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:57:08,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:57:08,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:57:08,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:57:08,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 00:57:08,785 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 00:57:08,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:57:08,786 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 00:57:08,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:57:08,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:57:08,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:57:08,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:57:08,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:57:08,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:57:08,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:08,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:57:08,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:57:08,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:57:08,789 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 00:57:08,789 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 00:57:08,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:57:08,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:57:08,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:57:08,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:57:08,790 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 -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2024-11-12 00:57:09,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:57:09,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:57:09,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:57:09,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:57:09,078 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:57:09,079 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_p02.c [2024-11-12 00:57:10,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:57:10,571 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:57:10,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-12 00:57:10,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351240bee/550c32df3874495f9af73f48b97c420f/FLAG6f1cd2e6c [2024-11-12 00:57:10,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351240bee/550c32df3874495f9af73f48b97c420f [2024-11-12 00:57:10,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:57:10,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:57:10,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:10,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:57:10,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:57:10,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:10" (1/1) ... [2024-11-12 00:57:10,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d7e953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:10, skipping insertion in model container [2024-11-12 00:57:10,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:10" (1/1) ... [2024-11-12 00:57:10,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:57:11,154 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_p02.c[1259,1272] [2024-11-12 00:57:11,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:11,406 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:57:11,416 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_p02.c[1259,1272] [2024-11-12 00:57:11,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:11,488 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:57:11,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11 WrapperNode [2024-11-12 00:57:11,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:11,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:11,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:57:11,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:57:11,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,573 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1072 [2024-11-12 00:57:11,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:11,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:57:11,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:57:11,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:57:11,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,635 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-12 00:57:11,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:57:11,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:57:11,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:57:11,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:57:11,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (1/1) ... [2024-11-12 00:57:11,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:11,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:57:11,723 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-12 00:57:11,725 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-12 00:57:11,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:57:11,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 00:57:11,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:57:11,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:57:11,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:57:11,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:57:12,923 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-12 00:57:12,923 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:57:12,934 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:57:12,934 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:57:12,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:12 BoogieIcfgContainer [2024-11-12 00:57:12,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:57:12,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:57:12,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:57:12,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:57:12,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:57:10" (1/3) ... [2024-11-12 00:57:12,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615640d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:12, skipping insertion in model container [2024-11-12 00:57:12,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:11" (2/3) ... [2024-11-12 00:57:12,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615640d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:12, skipping insertion in model container [2024-11-12 00:57:12,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:12" (3/3) ... [2024-11-12 00:57:12,942 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-12 00:57:12,954 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:57:12,954 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:57:13,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:57:13,012 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;@354116ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:57:13,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:57:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 00:57:13,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:13,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 00:57:13,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:13,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:13,027 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-12 00:57:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:57:13,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756288946] [2024-11-12 00:57:13,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:13,040 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-12 00:57:13,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:57:13,042 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-12 00:57:13,062 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-12 00:57:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:13,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 00:57:13,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:57:13,468 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-12 00:57:13,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:57:13,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:57:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756288946] [2024-11-12 00:57:13,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756288946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:13,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:13,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:57:13,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874778129] [2024-11-12 00:57:13,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:13,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:57:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:57:13,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:57:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:13,494 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:13,564 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-12 00:57:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:57:13,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 00:57:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:13,571 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:57:13,571 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 00:57:13,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:13,578 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:13,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 00:57:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 00:57:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 00:57:13,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 00:57:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 00:57:13,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 00:57:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 00:57:13,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:13,600 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:13,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 00:57:13,800 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-12 00:57:13,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:13,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-12 00:57:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:57:13,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509579027] [2024-11-12 00:57:13,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:13,803 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-12 00:57:13,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:57:13,805 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-12 00:57:13,806 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-12 00:57:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:14,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 00:57:14,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:57:14,408 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-12 00:57:14,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:57:15,896 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-12 00:57:15,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:57:15,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509579027] [2024-11-12 00:57:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509579027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:57:15,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:57:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 00:57:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853266123] [2024-11-12 00:57:15,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:57:15,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:57:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:57:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:57:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:57:15,898 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:16,053 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-12 00:57:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:57:16,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 00:57:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:16,054 INFO L225 Difference]: With dead ends: 15 [2024-11-12 00:57:16,054 INFO L226 Difference]: Without dead ends: 13 [2024-11-12 00:57:16,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:57:16,055 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:16,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-12 00:57:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-12 00:57:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-12 00:57:16,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-12 00:57:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:16,058 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-12 00:57:16,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-12 00:57:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 00:57:16,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:16,059 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-12 00:57:16,065 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-12 00:57:16,262 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-12 00:57:16,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:16,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:16,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-12 00:57:16,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:57:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81760126] [2024-11-12 00:57:16,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 00:57:16,265 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-12 00:57:16,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:57:16,267 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-12 00:57:16,268 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-12 00:57:16,645 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 00:57:16,645 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:57:16,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 00:57:16,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:57:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:17,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:57:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:57,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:57:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81760126] [2024-11-12 00:57:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81760126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:57:57,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:57:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-12 00:57:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455767244] [2024-11-12 00:57:57,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:57:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 00:57:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:57:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 00:57:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:57:57,641 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:58,058 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-12 00:57:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:57:58,059 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 00:57:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:58,059 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:57:58,059 INFO L226 Difference]: Without dead ends: 16 [2024-11-12 00:57:58,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-12 00:57:58,061 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:58,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:57:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-12 00:57:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-12 00:57:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-12 00:57:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-12 00:57:58,065 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-12 00:57:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:58,065 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-12 00:57:58,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-12 00:57:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 00:57:58,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:58,066 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-12 00:57:58,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 00:57:58,266 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-12 00:57:58,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:58,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-12 00:57:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:57:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249408385] [2024-11-12 00:57:58,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 00:57:58,269 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-12 00:57:58,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:57:58,273 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-12 00:57:58,274 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-12 00:57:58,688 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-12 00:57:58,688 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:57:58,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-12 00:57:58,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:57:59,135 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-12 00:57:59,135 INFO L312 TraceCheckSpWp]: Computing backward predicates...