./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:58:57,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:58:57,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:58:57,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:58:57,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:58:57,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:58:57,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:58:57,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:58:57,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:58:57,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:58:57,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:58:57,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:58:57,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:58:57,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:58:57,477 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:58:57,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:58:57,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:58:57,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:58:57,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:58:57,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:58:57,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:58:57,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:58:57,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:58:57,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:58:57,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:58:57,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:58:57,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:58:57,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:58:57,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:58:57,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:58:57,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:58:57,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:58:57,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:58:57,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:58:57,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:58:57,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:58:57,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:58:57,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:58:57,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:58:57,487 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-clean/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-clean/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 -> 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 [2024-10-11 06:58:57,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:58:57,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:58:57,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:58:57,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:58:57,787 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:58:57,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-10-11 06:58:59,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:58:59,428 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:58:59,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-10-11 06:58:59,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa27d303a/108798940df642d1aa48604199753e8b/FLAG6bb19ad56 [2024-10-11 06:58:59,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa27d303a/108798940df642d1aa48604199753e8b [2024-10-11 06:58:59,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:58:59,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:58:59,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:59,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:58:59,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:58:59,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:58:59,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16483667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59, skipping insertion in model container [2024-10-11 06:58:59,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:58:59,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:58:59,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2024-10-11 06:58:59,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:59,867 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:58:59,877 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2024-10-11 06:58:59,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:59,965 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:58:59,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59 WrapperNode [2024-10-11 06:58:59,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:59,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:58:59,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:58:59,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:58:59,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:58:59,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,062 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 706 [2024-10-11 06:59:00,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:59:00,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:59:00,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:59:00,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:59:00,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,130 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-10-11 06:59:00,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:59:00,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:59:00,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:59:00,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:59:00,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (1/1) ... [2024-10-11 06:59:00,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:59:00,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:59:00,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:59:00,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:59:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:59:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:59:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:59:00,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:59:00,460 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:59:00,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:59:01,293 INFO L? ?]: Removed 342 outVars from TransFormulas that were not future-live. [2024-10-11 06:59:01,294 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:59:01,331 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:59:01,333 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:59:01,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:01 BoogieIcfgContainer [2024-10-11 06:59:01,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:59:01,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:59:01,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:59:01,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:59:01,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:58:59" (1/3) ... [2024-10-11 06:59:01,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba01d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:59:01, skipping insertion in model container [2024-10-11 06:59:01,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:59" (2/3) ... [2024-10-11 06:59:01,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba01d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:59:01, skipping insertion in model container [2024-10-11 06:59:01,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:01" (3/3) ... [2024-10-11 06:59:01,345 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-10-11 06:59:01,363 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:59:01,364 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:59:01,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:59:01,433 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;@606a2c83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:59:01,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:59:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 134 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 06:59:01,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:01,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:01,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:01,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1461182874, now seen corresponding path program 1 times [2024-10-11 06:59:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:01,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856715807] [2024-10-11 06:59:01,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:02,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856715807] [2024-10-11 06:59:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856715807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:02,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:59:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948231833] [2024-10-11 06:59:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:02,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:59:02,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:59:02,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:02,260 INFO L87 Difference]: Start difference. First operand has 135 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 134 states have internal predecessors, (200), 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 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:02,320 INFO L93 Difference]: Finished difference Result 222 states and 330 transitions. [2024-10-11 06:59:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:59:02,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2024-10-11 06:59:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:02,329 INFO L225 Difference]: With dead ends: 222 [2024-10-11 06:59:02,330 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 06:59:02,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:02,335 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:02,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:59:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 06:59:02,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-11 06:59:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 200 transitions. [2024-10-11 06:59:02,370 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 200 transitions. Word has length 38 [2024-10-11 06:59:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:02,371 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 200 transitions. [2024-10-11 06:59:02,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 200 transitions. [2024-10-11 06:59:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 06:59:02,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:02,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:02,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:59:02,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:02,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:02,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1949666536, now seen corresponding path program 1 times [2024-10-11 06:59:02,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:02,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629228850] [2024-10-11 06:59:02,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:02,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:02,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629228850] [2024-10-11 06:59:02,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629228850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:02,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:02,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:59:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429541934] [2024-10-11 06:59:02,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:02,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:59:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:59:02,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:59:02,599 INFO L87 Difference]: Start difference. First operand 136 states and 200 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:03,046 INFO L93 Difference]: Finished difference Result 330 states and 481 transitions. [2024-10-11 06:59:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:59:03,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2024-10-11 06:59:03,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:03,050 INFO L225 Difference]: With dead ends: 330 [2024-10-11 06:59:03,050 INFO L226 Difference]: Without dead ends: 171 [2024-10-11 06:59:03,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:59:03,052 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 457 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:03,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 552 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:59:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-11 06:59:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2024-10-11 06:59:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-10-11 06:59:03,071 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 39 [2024-10-11 06:59:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:03,072 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-10-11 06:59:03,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-10-11 06:59:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 06:59:03,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:03,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:03,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:59:03,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:03,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:03,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1082690161, now seen corresponding path program 1 times [2024-10-11 06:59:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:03,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281563476] [2024-10-11 06:59:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:03,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:03,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:03,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281563476] [2024-10-11 06:59:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281563476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:03,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:03,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:59:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747750394] [2024-10-11 06:59:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:03,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:59:03,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:03,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:59:03,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:03,246 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:03,274 INFO L93 Difference]: Finished difference Result 231 states and 338 transitions. [2024-10-11 06:59:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:59:03,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-11 06:59:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:03,277 INFO L225 Difference]: With dead ends: 231 [2024-10-11 06:59:03,279 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 06:59:03,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:03,280 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:03,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:59:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 06:59:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-11 06:59:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4685314685314685) internal successors, (210), 143 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-10-11 06:59:03,291 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 40 [2024-10-11 06:59:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:03,291 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-10-11 06:59:03,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-10-11 06:59:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 06:59:03,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:03,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:03,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:59:03,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:03,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1894309098, now seen corresponding path program 1 times [2024-10-11 06:59:03,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:03,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657947607] [2024-10-11 06:59:03,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:03,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:03,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657947607] [2024-10-11 06:59:03,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657947607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:03,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:03,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:59:03,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759583225] [2024-10-11 06:59:03,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:03,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:59:03,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:03,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:59:03,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:59:03,712 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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-10-11 06:59:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:03,844 INFO L93 Difference]: Finished difference Result 237 states and 345 transitions. [2024-10-11 06:59:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:59:03,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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-10-11 06:59:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:03,846 INFO L225 Difference]: With dead ends: 237 [2024-10-11 06:59:03,846 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 06:59:03,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:59:03,847 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 172 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:03,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 877 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 06:59:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-10-11 06:59:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4589041095890412) internal successors, (213), 146 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2024-10-11 06:59:03,863 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 41 [2024-10-11 06:59:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:03,864 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2024-10-11 06:59:03,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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-10-11 06:59:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2024-10-11 06:59:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 06:59:03,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:03,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:03,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:59:03,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:03,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1980120168, now seen corresponding path program 1 times [2024-10-11 06:59:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:03,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880199665] [2024-10-11 06:59:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:04,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880199665] [2024-10-11 06:59:04,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880199665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:04,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:04,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:59:04,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913646380] [2024-10-11 06:59:04,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:04,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:59:04,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:59:04,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:59:04,407 INFO L87 Difference]: Start difference. First operand 147 states and 213 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 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-10-11 06:59:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:04,544 INFO L93 Difference]: Finished difference Result 253 states and 364 transitions. [2024-10-11 06:59:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:59:04,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 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-10-11 06:59:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:04,546 INFO L225 Difference]: With dead ends: 253 [2024-10-11 06:59:04,546 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 06:59:04,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:59:04,547 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 189 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:04,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1305 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 06:59:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-10-11 06:59:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4458598726114649) internal successors, (227), 157 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2024-10-11 06:59:04,554 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 42 [2024-10-11 06:59:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:04,554 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2024-10-11 06:59:04,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 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-10-11 06:59:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2024-10-11 06:59:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 06:59:04,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:04,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:04,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:59:04,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:04,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash -934836557, now seen corresponding path program 1 times [2024-10-11 06:59:04,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:04,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293296230] [2024-10-11 06:59:04,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:04,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:05,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293296230] [2024-10-11 06:59:05,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293296230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:05,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:05,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:59:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516444132] [2024-10-11 06:59:05,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:05,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:59:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:05,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:59:05,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:59:05,140 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 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-10-11 06:59:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:05,442 INFO L93 Difference]: Finished difference Result 264 states and 378 transitions. [2024-10-11 06:59:05,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:59:05,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 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-10-11 06:59:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:05,446 INFO L225 Difference]: With dead ends: 264 [2024-10-11 06:59:05,446 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 06:59:05,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-11 06:59:05,448 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 190 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:05,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1402 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:59:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 06:59:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2024-10-11 06:59:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.44375) internal successors, (231), 160 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 231 transitions. [2024-10-11 06:59:05,461 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 231 transitions. Word has length 43 [2024-10-11 06:59:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:05,461 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 231 transitions. [2024-10-11 06:59:05,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 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-10-11 06:59:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 231 transitions. [2024-10-11 06:59:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 06:59:05,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:05,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:05,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:59:05,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:05,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash 109334710, now seen corresponding path program 1 times [2024-10-11 06:59:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644425955] [2024-10-11 06:59:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:05,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:59:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644425955] [2024-10-11 06:59:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644425955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:05,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:05,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:59:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517098181] [2024-10-11 06:59:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:59:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:59:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:59:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:59:05,616 INFO L87 Difference]: Start difference. First operand 161 states and 231 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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-10-11 06:59:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:05,691 INFO L93 Difference]: Finished difference Result 338 states and 481 transitions. [2024-10-11 06:59:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:59:05,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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-10-11 06:59:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:05,693 INFO L225 Difference]: With dead ends: 338 [2024-10-11 06:59:05,693 INFO L226 Difference]: Without dead ends: 230 [2024-10-11 06:59:05,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-11 06:59:05,694 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 373 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:05,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 553 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-11 06:59:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 157. [2024-10-11 06:59:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.4423076923076923) internal successors, (225), 156 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2024-10-11 06:59:05,700 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 43 [2024-10-11 06:59:05,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:05,700 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2024-10-11 06:59:05,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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-10-11 06:59:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2024-10-11 06:59:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 06:59:05,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:05,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:05,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:59:05,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:05,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1645584169, now seen corresponding path program 1 times [2024-10-11 06:59:05,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:59:05,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957785222] [2024-10-11 06:59:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:59:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:59:05,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:59:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:59:05,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:59:05,789 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:59:05,790 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:59:05,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:59:05,795 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:59:05,857 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:59:05,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:59:05 BoogieIcfgContainer [2024-10-11 06:59:05,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:59:05,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:59:05,863 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:59:05,863 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:59:05,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:01" (3/4) ... [2024-10-11 06:59:05,866 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:59:05,868 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:59:05,868 INFO L158 Benchmark]: Toolchain (without parser) took 6412.00ms. Allocated memory was 151.0MB in the beginning and 251.7MB in the end (delta: 100.7MB). Free memory was 97.5MB in the beginning and 124.0MB in the end (delta: -26.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2024-10-11 06:59:05,868 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:59:05,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.35ms. Allocated memory is still 151.0MB. Free memory was 97.1MB in the beginning and 109.9MB in the end (delta: -12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 06:59:05,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.19ms. Allocated memory is still 151.0MB. Free memory was 109.9MB in the beginning and 96.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 06:59:05,869 INFO L158 Benchmark]: Boogie Preprocessor took 150.13ms. Allocated memory is still 151.0MB. Free memory was 96.0MB in the beginning and 86.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 06:59:05,869 INFO L158 Benchmark]: RCFGBuilder took 1120.31ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 86.9MB in the beginning and 123.5MB in the end (delta: -36.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2024-10-11 06:59:05,870 INFO L158 Benchmark]: TraceAbstraction took 4523.99ms. Allocated memory was 203.4MB in the beginning and 251.7MB in the end (delta: 48.2MB). Free memory was 122.4MB in the beginning and 124.0MB in the end (delta: -1.6MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2024-10-11 06:59:05,870 INFO L158 Benchmark]: Witness Printer took 5.57ms. Allocated memory is still 251.7MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:59:05,871 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.19ms. Allocated memory is still 96.5MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.35ms. Allocated memory is still 151.0MB. Free memory was 97.1MB in the beginning and 109.9MB in the end (delta: -12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.19ms. Allocated memory is still 151.0MB. Free memory was 109.9MB in the beginning and 96.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 150.13ms. Allocated memory is still 151.0MB. Free memory was 96.0MB in the beginning and 86.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1120.31ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 86.9MB in the beginning and 123.5MB in the end (delta: -36.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4523.99ms. Allocated memory was 203.4MB in the beginning and 251.7MB in the end (delta: 48.2MB). Free memory was 122.4MB in the beginning and 124.0MB in the end (delta: -1.6MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Witness Printer took 5.57ms. Allocated memory is still 251.7MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of bitwiseAnd at line 167. 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 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_18 mask_SORT_18 = (SORT_18)-1 >> (sizeof(SORT_18) * 8 - 4); [L36] const SORT_18 msb_SORT_18 = (SORT_18)1 << (4 - 1); [L38] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 10); [L39] const SORT_71 msb_SORT_71 = (SORT_71)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 1; [L43] const SORT_1 var_15 = 1; [L44] const SORT_18 var_20 = 1; [L45] const SORT_71 var_72 = 0; [L46] const SORT_10 var_81 = 104; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_32; [L53] SORT_18 input_34; [L54] SORT_1 input_36; [L55] SORT_18 input_38; [L56] SORT_1 input_40; [L57] SORT_1 input_42; [L58] SORT_1 input_48; [L59] SORT_1 input_50; [L60] SORT_1 input_52; [L61] SORT_3 input_54; [L62] SORT_1 input_57; [L63] SORT_1 input_67; [L64] SORT_1 input_75; [L65] SORT_1 input_76; [L66] SORT_1 input_77; [L67] SORT_1 input_89; [L68] SORT_1 input_90; [L69] SORT_1 input_91; [L70] SORT_1 input_102; [L71] SORT_1 input_108; [L72] SORT_1 input_114; [L73] SORT_1 input_125; [L74] SORT_1 input_127; [L75] SORT_71 input_142; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L77] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L78] SORT_1 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L79] SORT_1 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L80] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L81] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L82] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L83] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L84] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L85] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L86] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L87] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_ushort() & mask_SORT_71 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L88] SORT_71 state_73 = __VERIFIER_nondet_ushort() & mask_SORT_71; [L90] SORT_1 init_9_arg_1 = var_7; [L91] state_8 = init_9_arg_1 [L92] SORT_1 init_17_arg_1 = var_15; [L93] state_16 = init_17_arg_1 [L94] SORT_1 init_29_arg_1 = var_7; [L95] state_28 = init_29_arg_1 [L96] SORT_1 init_31_arg_1 = var_7; [L97] state_30 = init_31_arg_1 [L98] SORT_1 init_45_arg_1 = var_7; [L99] state_44 = init_45_arg_1 [L100] SORT_1 init_47_arg_1 = var_7; [L101] state_46 = init_47_arg_1 [L102] SORT_1 init_60_arg_1 = var_7; [L103] state_59 = init_60_arg_1 [L104] SORT_1 init_62_arg_1 = var_7; [L105] state_61 = init_62_arg_1 [L106] SORT_1 init_64_arg_1 = var_7; [L107] state_63 = init_64_arg_1 [L108] SORT_1 init_66_arg_1 = var_7; [L109] state_65 = init_66_arg_1 [L110] SORT_1 init_70_arg_1 = var_7; [L111] state_69 = init_70_arg_1 [L112] SORT_71 init_74_arg_1 = var_72; [L113] state_73 = init_74_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L116] input_2 = __VERIFIER_nondet_uchar() [L117] input_4 = __VERIFIER_nondet_uchar() [L118] input_5 = __VERIFIER_nondet_uchar() [L119] input_6 = __VERIFIER_nondet_uchar() [L120] input_32 = __VERIFIER_nondet_uchar() [L121] input_34 = __VERIFIER_nondet_uchar() [L122] input_36 = __VERIFIER_nondet_uchar() [L123] input_38 = __VERIFIER_nondet_uchar() [L124] input_40 = __VERIFIER_nondet_uchar() [L125] input_42 = __VERIFIER_nondet_uchar() [L126] input_48 = __VERIFIER_nondet_uchar() [L127] input_50 = __VERIFIER_nondet_uchar() [L128] input_52 = __VERIFIER_nondet_uchar() [L129] input_54 = __VERIFIER_nondet_uchar() [L130] input_57 = __VERIFIER_nondet_uchar() [L131] input_67 = __VERIFIER_nondet_uchar() [L132] input_75 = __VERIFIER_nondet_uchar() [L133] input_76 = __VERIFIER_nondet_uchar() [L134] input_77 = __VERIFIER_nondet_uchar() [L135] input_89 = __VERIFIER_nondet_uchar() [L136] input_90 = __VERIFIER_nondet_uchar() [L137] input_91 = __VERIFIER_nondet_uchar() [L138] input_102 = __VERIFIER_nondet_uchar() [L139] input_108 = __VERIFIER_nondet_uchar() [L140] input_114 = __VERIFIER_nondet_uchar() [L141] input_125 = __VERIFIER_nondet_uchar() [L142] input_127 = __VERIFIER_nondet_uchar() [L143] input_142 = __VERIFIER_nondet_ushort() [L146] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_11_arg_0=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L147] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L147] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L148] SORT_10 var_11 = var_11_arg_0; [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_1 var_14_arg_0 = var_13; [L153] SORT_1 var_14 = ~var_14_arg_0; [L154] SORT_1 var_19_arg_0 = state_16; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_14=-1, var_15=1, var_19_arg_0=1, var_20=1, var_72=0, var_7=0, var_81=104] [L155] EXPR var_19_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_14=-1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L155] var_19_arg_0 = var_19_arg_0 & mask_SORT_1 [L156] SORT_18 var_19 = var_19_arg_0; [L157] SORT_18 var_21_arg_0 = var_19; [L158] SORT_18 var_21_arg_1 = var_20; [L159] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L160] SORT_1 var_22_arg_0 = var_14; [L161] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_22_arg_0=-1, var_22_arg_1=1, var_72=0, var_7=0, var_81=104] [L162] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L162] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L163] SORT_1 var_25_arg_0 = var_22; [L164] SORT_1 var_25 = ~var_25_arg_0; [L165] SORT_1 var_26_arg_0 = var_15; [L166] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_26_arg_0=1, var_26_arg_1=-1, var_72=0, var_7=0, var_81=104] [L167] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L167] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L168] EXPR var_26 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L168] var_26 = var_26 & mask_SORT_1 [L169] SORT_1 bad_27_arg_0 = var_26; [L170] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 135 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1381 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1381 mSDsluCounter, 5846 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4561 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1285 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=6, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 106 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 06:59:05,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:59:08,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:59:08,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:59:08,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:59:08,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:59:08,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:59:08,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:59:08,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:59:08,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:59:08,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:59:08,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:59:08,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:59:08,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:59:08,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:59:08,298 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:59:08,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:59:08,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:59:08,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:59:08,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:59:08,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:59:08,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:59:08,302 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:59:08,303 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:59:08,303 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:59:08,303 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:59:08,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:59:08,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:59:08,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:59:08,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:59:08,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:59:08,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:59:08,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:59:08,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:59:08,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:59:08,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:59:08,306 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:59:08,307 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:59:08,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:59:08,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:59:08,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:59:08,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:59:08,309 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:59:08,309 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-clean/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-clean/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 -> 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 [2024-10-11 06:59:08,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:59:08,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:59:08,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:59:08,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:59:08,680 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:59:08,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-10-11 06:59:10,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:59:10,388 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:59:10,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-10-11 06:59:10,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6f8523cd/e5880e39fdcd466ab7d3a8b914ac3f7f/FLAG734c7eed8 [2024-10-11 06:59:10,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6f8523cd/e5880e39fdcd466ab7d3a8b914ac3f7f [2024-10-11 06:59:10,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:59:10,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:59:10,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:59:10,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:59:10,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:59:10,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:10,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c7b2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10, skipping insertion in model container [2024-10-11 06:59:10,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:10,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:59:10,686 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2024-10-11 06:59:10,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:59:10,839 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:59:10,853 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2024-10-11 06:59:10,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:59:10,935 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:59:10,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10 WrapperNode [2024-10-11 06:59:10,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:59:10,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:59:10,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:59:10,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:59:10,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:10,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,002 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 450 [2024-10-11 06:59:11,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:59:11,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:59:11,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:59:11,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:59:11,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,049 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-10-11 06:59:11,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:59:11,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:59:11,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:59:11,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:59:11,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (1/1) ... [2024-10-11 06:59:11,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:59:11,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:59:11,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:59:11,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:59:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:59:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:59:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:59:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:59:11,338 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:59:11,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:59:11,795 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-11 06:59:11,795 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:59:11,846 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:59:11,847 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:59:11,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:11 BoogieIcfgContainer [2024-10-11 06:59:11,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:59:11,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:59:11,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:59:11,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:59:11,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:59:10" (1/3) ... [2024-10-11 06:59:11,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2e0b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:59:11, skipping insertion in model container [2024-10-11 06:59:11,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:59:10" (2/3) ... [2024-10-11 06:59:11,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2e0b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:59:11, skipping insertion in model container [2024-10-11 06:59:11,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:59:11" (3/3) ... [2024-10-11 06:59:11,858 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-10-11 06:59:11,876 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:59:11,876 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:59:11,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:59:11,951 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;@2ee5c3e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:59:11,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:59:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:59:11,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:11,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:59:11,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:59:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:59:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120017484] [2024-10-11 06:59:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:12,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:59:12,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:59:12,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:59:12,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 06:59:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:12,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 06:59:12,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:59:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:12,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:59:12,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:59:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120017484] [2024-10-11 06:59:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120017484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:59:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:59:12,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:59:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003334599] [2024-10-11 06:59:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:59:12,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:59:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:59:12,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:59:12,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:59:12,443 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:12,508 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 06:59:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:59:12,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:59:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:12,518 INFO L225 Difference]: With dead ends: 15 [2024-10-11 06:59:12,519 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 06:59:12,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:59:12,527 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:12,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:59:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 06:59:12,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 06:59:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:59:12,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:59:12,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:12,559 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:59:12,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:59:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:59:12,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:12,560 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:59:12,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 06:59:12,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:59:12,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:12,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:59:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:59:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388549514] [2024-10-11 06:59:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:59:12,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:59:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:59:12,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:59:12,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 06:59:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:59:12,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 06:59:12,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:59:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:13,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:59:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:13,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:59:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388549514] [2024-10-11 06:59:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388549514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:59:13,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 06:59:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 06:59:13,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543271276] [2024-10-11 06:59:13,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 06:59:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:59:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:59:13,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:59:13,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:59:13,771 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:59:13,991 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-11 06:59:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:59:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 06:59:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:59:13,993 INFO L225 Difference]: With dead ends: 17 [2024-10-11 06:59:13,993 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 06:59:13,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:59:13,994 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:59:13,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:59:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 06:59:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-11 06:59:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-11 06:59:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-11 06:59:14,000 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-11 06:59:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:59:14,001 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-11 06:59:14,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:59:14,001 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-11 06:59:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 06:59:14,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:59:14,002 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-11 06:59:14,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 06:59:14,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:59:14,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:59:14,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:59:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-11 06:59:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:59:14,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743024750] [2024-10-11 06:59:14,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 06:59:14,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:59:14,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:59:14,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:59:14,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 06:59:14,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 06:59:14,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 06:59:14,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 06:59:14,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:59:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:59:45,211 INFO L311 TraceCheckSpWp]: Computing backward predicates...