./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.vis_QF_BV_s1269b_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:09:44,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:09:44,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 07:09:44,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:09:44,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:09:44,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:09:44,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:09:44,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:09:44,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:09:44,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:09:44,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:09:44,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:09:44,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:09:44,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:09:44,333 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:09:44,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:09:44,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:09:44,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:09:44,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:09:44,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:09:44,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:09:44,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:09:44,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:09:44,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:09:44,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:09:44,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:09:44,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:09:44,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:09:44,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:09:44,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:09:44,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:09:44,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:09:44,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:09:44,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:09:44,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:09:44,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:09:44,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:09:44,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:09:44,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:09:44,341 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c [2024-10-14 07:09:44,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:09:44,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:09:44,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:09:44,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:09:44,578 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:09:44,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-14 07:09:45,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:09:45,959 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:09:45,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-14 07:09:45,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35785ab8e/db36291dd2f840caa152972ed882e5e6/FLAG696c694b3 [2024-10-14 07:09:46,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35785ab8e/db36291dd2f840caa152972ed882e5e6 [2024-10-14 07:09:46,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:09:46,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:09:46,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:09:46,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:09:46,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:09:46,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41bb6d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46, skipping insertion in model container [2024-10-14 07:09:46,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:09:46,530 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.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-10-14 07:09:46,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:09:46,623 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:09:46,634 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.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-10-14 07:09:46,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:09:46,695 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:09:46,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46 WrapperNode [2024-10-14 07:09:46,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:09:46,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:09:46,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:09:46,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:09:46,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,767 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 484 [2024-10-14 07:09:46,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:09:46,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:09:46,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:09:46,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:09:46,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,835 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-14 07:09:46,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:09:46,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:09:46,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:09:46,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:09:46,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (1/1) ... [2024-10-14 07:09:46,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:09:46,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:09:46,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:09:46,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:09:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:09:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:09:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:09:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:09:47,054 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:09:47,056 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:09:47,582 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2024-10-14 07:09:47,582 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:09:47,606 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:09:47,609 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:09:47,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:09:47 BoogieIcfgContainer [2024-10-14 07:09:47,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:09:47,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:09:47,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:09:47,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:09:47,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:09:46" (1/3) ... [2024-10-14 07:09:47,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c998eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:09:47, skipping insertion in model container [2024-10-14 07:09:47,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:09:46" (2/3) ... [2024-10-14 07:09:47,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c998eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:09:47, skipping insertion in model container [2024-10-14 07:09:47,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:09:47" (3/3) ... [2024-10-14 07:09:47,617 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-14 07:09:47,629 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:09:47,630 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:09:47,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:09:47,692 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;@277eaf1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:09:47,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:09:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.5041322314049588) internal successors, (182), 122 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 07:09:47,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:47,702 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] [2024-10-14 07:09:47,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:47,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:47,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1026487147, now seen corresponding path program 1 times [2024-10-14 07:09:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:47,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696246500] [2024-10-14 07:09:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:48,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:48,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696246500] [2024-10-14 07:09:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696246500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:48,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:09:48,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211346151] [2024-10-14 07:09:48,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:48,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:09:48,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:09:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:09:48,144 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.5041322314049588) internal successors, (182), 122 states have internal predecessors, (182), 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 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:48,197 INFO L93 Difference]: Finished difference Result 230 states and 342 transitions. [2024-10-14 07:09:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:09:48,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-10-14 07:09:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:48,207 INFO L225 Difference]: With dead ends: 230 [2024-10-14 07:09:48,207 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 07:09:48,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:09:48,213 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:48,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 526 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:09:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 07:09:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-14 07:09:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 123 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-10-14 07:09:48,244 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 22 [2024-10-14 07:09:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:48,246 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-10-14 07:09:48,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-10-14 07:09:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 07:09:48,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:48,247 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] [2024-10-14 07:09:48,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:09:48,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:48,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1754635215, now seen corresponding path program 1 times [2024-10-14 07:09:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308629412] [2024-10-14 07:09:48,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308629412] [2024-10-14 07:09:48,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308629412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:48,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:48,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:09:48,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065310152] [2024-10-14 07:09:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:48,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:09:48,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:48,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:09:48,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:09:48,368 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:48,407 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2024-10-14 07:09:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:09:48,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-10-14 07:09:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:48,409 INFO L225 Difference]: With dead ends: 233 [2024-10-14 07:09:48,409 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 07:09:48,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:09:48,411 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:48,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:09:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 07:09:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-14 07:09:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.472) internal successors, (184), 125 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-10-14 07:09:48,423 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 23 [2024-10-14 07:09:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:48,423 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-10-14 07:09:48,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-10-14 07:09:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 07:09:48,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:48,424 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] [2024-10-14 07:09:48,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:09:48,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:48,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash 342917358, now seen corresponding path program 1 times [2024-10-14 07:09:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:48,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165170941] [2024-10-14 07:09:48,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:48,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165170941] [2024-10-14 07:09:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165170941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:09:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365029914] [2024-10-14 07:09:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:48,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:09:48,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:48,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:09:48,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:09:48,698 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:48,764 INFO L93 Difference]: Finished difference Result 249 states and 364 transitions. [2024-10-14 07:09:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:09:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2024-10-14 07:09:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:48,766 INFO L225 Difference]: With dead ends: 249 [2024-10-14 07:09:48,767 INFO L226 Difference]: Without dead ends: 140 [2024-10-14 07:09:48,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:09:48,768 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 26 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:48,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 994 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:09:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-14 07:09:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-14 07:09:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.463768115942029) internal successors, (202), 138 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-10-14 07:09:48,781 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 24 [2024-10-14 07:09:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:48,782 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-10-14 07:09:48,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-10-14 07:09:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 07:09:48,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:48,783 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] [2024-10-14 07:09:48,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:09:48,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:48,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1556136331, now seen corresponding path program 1 times [2024-10-14 07:09:48,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:48,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119426371] [2024-10-14 07:09:48,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:48,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:49,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:49,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119426371] [2024-10-14 07:09:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119426371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:49,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 07:09:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780483545] [2024-10-14 07:09:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:49,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 07:09:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:49,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 07:09:49,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:09:49,361 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:49,601 INFO L93 Difference]: Finished difference Result 341 states and 492 transitions. [2024-10-14 07:09:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 07:09:49,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2024-10-14 07:09:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:49,603 INFO L225 Difference]: With dead ends: 341 [2024-10-14 07:09:49,603 INFO L226 Difference]: Without dead ends: 226 [2024-10-14 07:09:49,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-10-14 07:09:49,605 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 148 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:49,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1409 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:09:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-14 07:09:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 145. [2024-10-14 07:09:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4513888888888888) internal successors, (209), 144 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2024-10-14 07:09:49,614 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 26 [2024-10-14 07:09:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:49,614 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2024-10-14 07:09:49,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2024-10-14 07:09:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 07:09:49,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:49,615 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] [2024-10-14 07:09:49,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:09:49,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:49,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1734836073, now seen corresponding path program 1 times [2024-10-14 07:09:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:49,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46118007] [2024-10-14 07:09:49,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:49,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:49,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46118007] [2024-10-14 07:09:49,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46118007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:49,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:49,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:09:49,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387140476] [2024-10-14 07:09:49,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:49,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:09:49,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:49,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:09:49,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:09:49,916 INFO L87 Difference]: Start difference. First operand 145 states and 209 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:49,989 INFO L93 Difference]: Finished difference Result 254 states and 368 transitions. [2024-10-14 07:09:49,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:09:49,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-14 07:09:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:49,990 INFO L225 Difference]: With dead ends: 254 [2024-10-14 07:09:49,991 INFO L226 Difference]: Without dead ends: 140 [2024-10-14 07:09:49,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:09:49,993 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 25 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:49,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 996 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:09:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-14 07:09:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-14 07:09:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4532374100719425) internal successors, (202), 139 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 202 transitions. [2024-10-14 07:09:50,002 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 202 transitions. Word has length 27 [2024-10-14 07:09:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:50,002 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 202 transitions. [2024-10-14 07:09:50,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 202 transitions. [2024-10-14 07:09:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 07:09:50,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:50,004 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] [2024-10-14 07:09:50,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:09:50,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:50,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash 185382780, now seen corresponding path program 1 times [2024-10-14 07:09:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748297712] [2024-10-14 07:09:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:50,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:50,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748297712] [2024-10-14 07:09:50,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748297712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:50,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:09:50,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188858929] [2024-10-14 07:09:50,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:50,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:09:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:50,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:09:50,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:09:50,128 INFO L87 Difference]: Start difference. First operand 140 states and 202 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:50,201 INFO L93 Difference]: Finished difference Result 319 states and 458 transitions. [2024-10-14 07:09:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:09:50,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-14 07:09:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:50,202 INFO L225 Difference]: With dead ends: 319 [2024-10-14 07:09:50,202 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 07:09:50,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:09:50,205 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 108 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:50,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 975 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:09:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 07:09:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 141. [2024-10-14 07:09:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 140 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-10-14 07:09:50,217 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 27 [2024-10-14 07:09:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:50,218 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-10-14 07:09:50,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-10-14 07:09:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 07:09:50,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:50,218 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] [2024-10-14 07:09:50,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:09:50,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:50,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash -219183804, now seen corresponding path program 1 times [2024-10-14 07:09:50,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:50,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808711176] [2024-10-14 07:09:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:50,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808711176] [2024-10-14 07:09:50,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808711176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:50,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:50,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:09:50,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913100252] [2024-10-14 07:09:50,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:50,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:09:50,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:09:50,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:09:50,300 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:50,334 INFO L93 Difference]: Finished difference Result 311 states and 448 transitions. [2024-10-14 07:09:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:09:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2024-10-14 07:09:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:50,336 INFO L225 Difference]: With dead ends: 311 [2024-10-14 07:09:50,336 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 07:09:50,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:09:50,337 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 106 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:50,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 665 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:09:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 07:09:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 134. [2024-10-14 07:09:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 192 transitions. [2024-10-14 07:09:50,341 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 192 transitions. Word has length 28 [2024-10-14 07:09:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:50,341 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 192 transitions. [2024-10-14 07:09:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2024-10-14 07:09:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 07:09:50,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:50,343 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:09:50,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 07:09:50,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:50,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash 511610826, now seen corresponding path program 1 times [2024-10-14 07:09:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:50,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646819275] [2024-10-14 07:09:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646819275] [2024-10-14 07:09:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646819275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:50,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:50,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:09:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012687331] [2024-10-14 07:09:50,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:50,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:09:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:50,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:09:50,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:09:50,867 INFO L87 Difference]: Start difference. First operand 134 states and 192 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:50,999 INFO L93 Difference]: Finished difference Result 316 states and 458 transitions. [2024-10-14 07:09:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:09:50,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 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 77 [2024-10-14 07:09:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:51,001 INFO L225 Difference]: With dead ends: 316 [2024-10-14 07:09:51,001 INFO L226 Difference]: Without dead ends: 207 [2024-10-14 07:09:51,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:09:51,003 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 112 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:51,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1125 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:09:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-14 07:09:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 166. [2024-10-14 07:09:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4303030303030304) internal successors, (236), 165 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 236 transitions. [2024-10-14 07:09:51,010 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 236 transitions. Word has length 77 [2024-10-14 07:09:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:51,011 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 236 transitions. [2024-10-14 07:09:51,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 236 transitions. [2024-10-14 07:09:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 07:09:51,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:51,017 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:09:51,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 07:09:51,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1941714400, now seen corresponding path program 1 times [2024-10-14 07:09:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981746940] [2024-10-14 07:09:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981746940] [2024-10-14 07:09:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981746940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:51,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:51,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:09:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028299153] [2024-10-14 07:09:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:51,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:09:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:51,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:09:51,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:09:51,382 INFO L87 Difference]: Start difference. First operand 166 states and 236 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:51,435 INFO L93 Difference]: Finished difference Result 321 states and 461 transitions. [2024-10-14 07:09:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:09:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 07:09:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:51,437 INFO L225 Difference]: With dead ends: 321 [2024-10-14 07:09:51,437 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 07:09:51,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:09:51,439 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 109 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:51,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 996 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:09:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 07:09:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 169. [2024-10-14 07:09:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.4226190476190477) internal successors, (239), 168 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 239 transitions. [2024-10-14 07:09:51,444 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 239 transitions. Word has length 78 [2024-10-14 07:09:51,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:51,445 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 239 transitions. [2024-10-14 07:09:51,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 239 transitions. [2024-10-14 07:09:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 07:09:51,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:51,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:09:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 07:09:51,446 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:51,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1175772378, now seen corresponding path program 1 times [2024-10-14 07:09:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:51,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77149192] [2024-10-14 07:09:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77149192] [2024-10-14 07:09:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77149192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:51,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:51,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:09:51,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109833212] [2024-10-14 07:09:51,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:51,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:09:51,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:51,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:09:51,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:09:51,813 INFO L87 Difference]: Start difference. First operand 169 states and 239 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:51,825 INFO L93 Difference]: Finished difference Result 278 states and 398 transitions. [2024-10-14 07:09:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:09:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 07:09:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:51,827 INFO L225 Difference]: With dead ends: 278 [2024-10-14 07:09:51,827 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 07:09:51,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:09:51,828 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 2 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:51,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 346 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:09:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 07:09:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-10-14 07:09:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.4166666666666667) internal successors, (238), 168 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 238 transitions. [2024-10-14 07:09:51,832 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 238 transitions. Word has length 79 [2024-10-14 07:09:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:51,832 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 238 transitions. [2024-10-14 07:09:51,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 238 transitions. [2024-10-14 07:09:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 07:09:51,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:51,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:09:51,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 07:09:51,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:51,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1353017429, now seen corresponding path program 1 times [2024-10-14 07:09:51,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:51,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040314547] [2024-10-14 07:09:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:51,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:52,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:52,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040314547] [2024-10-14 07:09:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040314547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:52,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:52,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 07:09:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546849680] [2024-10-14 07:09:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 07:09:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 07:09:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:09:52,724 INFO L87 Difference]: Start difference. First operand 169 states and 238 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:52,918 INFO L93 Difference]: Finished difference Result 333 states and 477 transitions. [2024-10-14 07:09:52,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 07:09:52,919 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-14 07:09:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:52,920 INFO L225 Difference]: With dead ends: 333 [2024-10-14 07:09:52,920 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 07:09:52,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:09:52,921 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 86 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:52,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1833 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:09:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 07:09:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2024-10-14 07:09:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.413953488372093) internal successors, (304), 215 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 304 transitions. [2024-10-14 07:09:52,925 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 304 transitions. Word has length 80 [2024-10-14 07:09:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:52,925 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 304 transitions. [2024-10-14 07:09:52,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 304 transitions. [2024-10-14 07:09:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 07:09:52,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:52,926 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:09:52,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 07:09:52,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:52,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1342262796, now seen corresponding path program 1 times [2024-10-14 07:09:52,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:52,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377984244] [2024-10-14 07:09:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377984244] [2024-10-14 07:09:53,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377984244] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:09:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530674899] [2024-10-14 07:09:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:53,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:09:53,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:09:53,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:09:53,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 07:09:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:54,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-10-14 07:09:54,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:09:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:55,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:09:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:57,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530674899] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 07:09:57,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:09:57,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [19, 30] total 75 [2024-10-14 07:09:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054325989] [2024-10-14 07:09:57,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:57,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 07:09:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:57,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 07:09:57,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=5102, Unknown=0, NotChecked=0, Total=5550 [2024-10-14 07:09:57,786 INFO L87 Difference]: Start difference. First operand 216 states and 304 transitions. Second operand has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:59,346 INFO L93 Difference]: Finished difference Result 423 states and 603 transitions. [2024-10-14 07:09:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 07:09:59,347 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 07:09:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:59,348 INFO L225 Difference]: With dead ends: 423 [2024-10-14 07:09:59,348 INFO L226 Difference]: Without dead ends: 314 [2024-10-14 07:09:59,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=495, Invalid=5825, Unknown=0, NotChecked=0, Total=6320 [2024-10-14 07:09:59,350 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 127 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:59,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 3265 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 07:09:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-14 07:09:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 300. [2024-10-14 07:09:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.4214046822742474) internal successors, (425), 299 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 425 transitions. [2024-10-14 07:09:59,356 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 425 transitions. Word has length 81 [2024-10-14 07:09:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:59,356 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 425 transitions. [2024-10-14 07:09:59,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 425 transitions. [2024-10-14 07:09:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 07:09:59,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:59,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:09:59,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 07:09:59,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 07:09:59,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:59,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1220930199, now seen corresponding path program 1 times [2024-10-14 07:09:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:59,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876725030] [2024-10-14 07:09:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:09:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:09:59,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:09:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876725030] [2024-10-14 07:09:59,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876725030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:09:59,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:09:59,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:09:59,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769476937] [2024-10-14 07:09:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:09:59,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:09:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:09:59,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:09:59,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:09:59,756 INFO L87 Difference]: Start difference. First operand 300 states and 425 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:09:59,789 INFO L93 Difference]: Finished difference Result 508 states and 729 transitions. [2024-10-14 07:09:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:09:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 07:09:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:09:59,792 INFO L225 Difference]: With dead ends: 508 [2024-10-14 07:09:59,793 INFO L226 Difference]: Without dead ends: 347 [2024-10-14 07:09:59,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:09:59,794 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 71 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:09:59,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 652 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:09:59,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-14 07:09:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-10-14 07:09:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.4190751445086704) internal successors, (491), 346 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 491 transitions. [2024-10-14 07:09:59,802 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 491 transitions. Word has length 81 [2024-10-14 07:09:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:09:59,802 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 491 transitions. [2024-10-14 07:09:59,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:09:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 491 transitions. [2024-10-14 07:09:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 07:09:59,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:09:59,803 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:09:59,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 07:09:59,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:09:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:09:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1025730167, now seen corresponding path program 1 times [2024-10-14 07:09:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:09:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302557423] [2024-10-14 07:09:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:09:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:09:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302557423] [2024-10-14 07:10:00,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302557423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:00,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:00,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 07:10:00,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878815134] [2024-10-14 07:10:00,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:00,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 07:10:00,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:00,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 07:10:00,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:10:00,573 INFO L87 Difference]: Start difference. First operand 347 states and 491 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:00,829 INFO L93 Difference]: Finished difference Result 641 states and 917 transitions. [2024-10-14 07:10:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 07:10:00,829 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 07:10:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:00,831 INFO L225 Difference]: With dead ends: 641 [2024-10-14 07:10:00,831 INFO L226 Difference]: Without dead ends: 462 [2024-10-14 07:10:00,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:10:00,832 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 78 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:00,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1690 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:10:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-14 07:10:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 412. [2024-10-14 07:10:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.413625304136253) internal successors, (581), 411 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 581 transitions. [2024-10-14 07:10:00,840 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 581 transitions. Word has length 81 [2024-10-14 07:10:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:00,840 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 581 transitions. [2024-10-14 07:10:00,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 581 transitions. [2024-10-14 07:10:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 07:10:00,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:00,841 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:00,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 07:10:00,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:00,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1961321509, now seen corresponding path program 1 times [2024-10-14 07:10:00,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:00,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730605413] [2024-10-14 07:10:00,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:00,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730605413] [2024-10-14 07:10:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730605413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:01,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:10:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485926809] [2024-10-14 07:10:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:01,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:10:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:10:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:10:01,014 INFO L87 Difference]: Start difference. First operand 412 states and 581 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:01,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:01,068 INFO L93 Difference]: Finished difference Result 674 states and 957 transitions. [2024-10-14 07:10:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:10:01,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 07:10:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:01,070 INFO L225 Difference]: With dead ends: 674 [2024-10-14 07:10:01,070 INFO L226 Difference]: Without dead ends: 410 [2024-10-14 07:10:01,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:10:01,071 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 57 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:01,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 817 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-14 07:10:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2024-10-14 07:10:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4083129584352079) internal successors, (576), 409 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 576 transitions. [2024-10-14 07:10:01,079 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 576 transitions. Word has length 81 [2024-10-14 07:10:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:01,079 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 576 transitions. [2024-10-14 07:10:01,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 576 transitions. [2024-10-14 07:10:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 07:10:01,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:01,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:01,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 07:10:01,080 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:01,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:01,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1668046962, now seen corresponding path program 1 times [2024-10-14 07:10:01,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:01,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806298205] [2024-10-14 07:10:01,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:01,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:01,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:01,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806298205] [2024-10-14 07:10:01,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806298205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:01,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:01,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:10:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221352301] [2024-10-14 07:10:01,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:01,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:10:01,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:01,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:10:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:10:01,256 INFO L87 Difference]: Start difference. First operand 410 states and 576 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:01,283 INFO L93 Difference]: Finished difference Result 574 states and 815 transitions. [2024-10-14 07:10:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:10:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-14 07:10:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:01,285 INFO L225 Difference]: With dead ends: 574 [2024-10-14 07:10:01,285 INFO L226 Difference]: Without dead ends: 414 [2024-10-14 07:10:01,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:10:01,285 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 2 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 673 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:01,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 673 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-14 07:10:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 413. [2024-10-14 07:10:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4077669902912622) internal successors, (580), 412 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 580 transitions. [2024-10-14 07:10:01,292 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 580 transitions. Word has length 82 [2024-10-14 07:10:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:01,293 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 580 transitions. [2024-10-14 07:10:01,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 580 transitions. [2024-10-14 07:10:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 07:10:01,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:01,294 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:01,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 07:10:01,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:01,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:01,294 INFO L85 PathProgramCache]: Analyzing trace with hash -430639366, now seen corresponding path program 1 times [2024-10-14 07:10:01,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:01,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678568129] [2024-10-14 07:10:01,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:01,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:01,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678568129] [2024-10-14 07:10:01,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678568129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:10:01,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512245538] [2024-10-14 07:10:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:01,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:01,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:01,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:10:01,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 07:10:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:01,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-14 07:10:01,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:10:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:02,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:10:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512245538] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:10:03,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:10:03,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 27, 20] total 52 [2024-10-14 07:10:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102595131] [2024-10-14 07:10:03,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:10:03,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-14 07:10:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-14 07:10:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=2247, Unknown=0, NotChecked=0, Total=2756 [2024-10-14 07:10:03,230 INFO L87 Difference]: Start difference. First operand 413 states and 580 transitions. Second operand has 53 states, 53 states have (on average 4.264150943396227) internal successors, (226), 52 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:04,443 INFO L93 Difference]: Finished difference Result 869 states and 1241 transitions. [2024-10-14 07:10:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-14 07:10:04,443 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.264150943396227) internal successors, (226), 52 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-14 07:10:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:04,445 INFO L225 Difference]: With dead ends: 869 [2024-10-14 07:10:04,445 INFO L226 Difference]: Without dead ends: 706 [2024-10-14 07:10:04,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1269, Invalid=6563, Unknown=0, NotChecked=0, Total=7832 [2024-10-14 07:10:04,448 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1354 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 3494 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:04,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 3494 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:10:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-10-14 07:10:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 613. [2024-10-14 07:10:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 1.4199346405228759) internal successors, (869), 612 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 869 transitions. [2024-10-14 07:10:04,458 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 869 transitions. Word has length 82 [2024-10-14 07:10:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:04,458 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 869 transitions. [2024-10-14 07:10:04,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.264150943396227) internal successors, (226), 52 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 869 transitions. [2024-10-14 07:10:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 07:10:04,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:04,461 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:04,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 07:10:04,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 07:10:04,662 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:04,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash -285469247, now seen corresponding path program 1 times [2024-10-14 07:10:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444397434] [2024-10-14 07:10:04,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:05,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:05,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444397434] [2024-10-14 07:10:05,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444397434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:10:05,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189864246] [2024-10-14 07:10:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:05,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:05,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:05,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:10:05,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 07:10:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:05,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-10-14 07:10:05,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:10:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:06,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:10:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189864246] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:10:08,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:10:08,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31, 31] total 76 [2024-10-14 07:10:08,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577001274] [2024-10-14 07:10:08,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:10:08,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-10-14 07:10:08,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:08,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-10-14 07:10:08,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=5270, Unknown=0, NotChecked=0, Total=5852 [2024-10-14 07:10:08,706 INFO L87 Difference]: Start difference. First operand 613 states and 869 transitions. Second operand has 77 states, 77 states have (on average 2.935064935064935) internal successors, (226), 76 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:12,596 INFO L93 Difference]: Finished difference Result 1496 states and 2145 transitions. [2024-10-14 07:10:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-10-14 07:10:12,596 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.935064935064935) internal successors, (226), 76 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-14 07:10:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:12,600 INFO L225 Difference]: With dead ends: 1496 [2024-10-14 07:10:12,601 INFO L226 Difference]: Without dead ends: 1021 [2024-10-14 07:10:12,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4566 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1484, Invalid=13768, Unknown=0, NotChecked=0, Total=15252 [2024-10-14 07:10:12,610 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1244 mSDsluCounter, 4803 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 4921 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:12,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 4921 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2927 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 07:10:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-10-14 07:10:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 890. [2024-10-14 07:10:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.4308211473565804) internal successors, (1272), 889 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1272 transitions. [2024-10-14 07:10:12,632 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1272 transitions. Word has length 82 [2024-10-14 07:10:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:12,632 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1272 transitions. [2024-10-14 07:10:12,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.935064935064935) internal successors, (226), 76 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1272 transitions. [2024-10-14 07:10:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 07:10:12,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:12,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:12,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 07:10:12,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 07:10:12,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:12,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1304933153, now seen corresponding path program 1 times [2024-10-14 07:10:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:12,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446199791] [2024-10-14 07:10:12,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446199791] [2024-10-14 07:10:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446199791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:10:13,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450184683] [2024-10-14 07:10:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:13,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:10:13,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 07:10:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:13,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-14 07:10:13,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:10:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:13,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:10:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:14,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450184683] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 07:10:14,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:10:14,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 24] total 39 [2024-10-14 07:10:14,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805478649] [2024-10-14 07:10:14,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:14,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 07:10:14,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 07:10:14,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1366, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 07:10:14,231 INFO L87 Difference]: Start difference. First operand 890 states and 1272 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:14,504 INFO L93 Difference]: Finished difference Result 1881 states and 2710 transitions. [2024-10-14 07:10:14,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 07:10:14,505 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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 83 [2024-10-14 07:10:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:14,508 INFO L225 Difference]: With dead ends: 1881 [2024-10-14 07:10:14,508 INFO L226 Difference]: Without dead ends: 1290 [2024-10-14 07:10:14,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 131 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=2012, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 07:10:14,510 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 146 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:14,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 2220 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2024-10-14 07:10:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1027. [2024-10-14 07:10:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4249512670565303) internal successors, (1462), 1026 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1462 transitions. [2024-10-14 07:10:14,527 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1462 transitions. Word has length 83 [2024-10-14 07:10:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:14,528 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1462 transitions. [2024-10-14 07:10:14,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1462 transitions. [2024-10-14 07:10:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 07:10:14,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:14,529 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:14,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 07:10:14,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:14,729 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1607812553, now seen corresponding path program 1 times [2024-10-14 07:10:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952839785] [2024-10-14 07:10:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:14,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952839785] [2024-10-14 07:10:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952839785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:14,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:14,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:10:14,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608607534] [2024-10-14 07:10:14,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:14,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:10:14,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:14,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:10:14,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:10:14,923 INFO L87 Difference]: Start difference. First operand 1027 states and 1462 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:14,959 INFO L93 Difference]: Finished difference Result 1466 states and 2100 transitions. [2024-10-14 07:10:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:10:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2024-10-14 07:10:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:14,962 INFO L225 Difference]: With dead ends: 1466 [2024-10-14 07:10:14,963 INFO L226 Difference]: Without dead ends: 998 [2024-10-14 07:10:14,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:10:14,964 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 54 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:14,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 661 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-10-14 07:10:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2024-10-14 07:10:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.423269809428285) internal successors, (1419), 997 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1419 transitions. [2024-10-14 07:10:14,988 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1419 transitions. Word has length 83 [2024-10-14 07:10:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:14,988 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1419 transitions. [2024-10-14 07:10:14,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1419 transitions. [2024-10-14 07:10:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:10:14,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:14,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:14,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 07:10:14,990 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:14,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash 671859933, now seen corresponding path program 1 times [2024-10-14 07:10:14,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:14,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315175928] [2024-10-14 07:10:14,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315175928] [2024-10-14 07:10:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315175928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:10:15,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551088512] [2024-10-14 07:10:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:15,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:15,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:15,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:10:15,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 07:10:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:15,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-14 07:10:15,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:10:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 07:10:15,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:10:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551088512] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:10:15,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:10:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 21 [2024-10-14 07:10:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241094646] [2024-10-14 07:10:15,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:10:15,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 07:10:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:15,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 07:10:15,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-10-14 07:10:15,992 INFO L87 Difference]: Start difference. First operand 998 states and 1419 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:16,149 INFO L93 Difference]: Finished difference Result 3103 states and 4433 transitions. [2024-10-14 07:10:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 07:10:16,149 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 21 states have internal predecessors, (153), 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 84 [2024-10-14 07:10:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:16,154 INFO L225 Difference]: With dead ends: 3103 [2024-10-14 07:10:16,154 INFO L226 Difference]: Without dead ends: 2156 [2024-10-14 07:10:16,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 152 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2024-10-14 07:10:16,156 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 453 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:16,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 2130 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2024-10-14 07:10:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1902. [2024-10-14 07:10:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1901 states have (on average 1.4213571804313518) internal successors, (2702), 1901 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2702 transitions. [2024-10-14 07:10:16,185 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2702 transitions. Word has length 84 [2024-10-14 07:10:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:16,185 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 2702 transitions. [2024-10-14 07:10:16,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2702 transitions. [2024-10-14 07:10:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:10:16,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:16,187 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:16,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 07:10:16,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:16,388 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:16,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1778887901, now seen corresponding path program 1 times [2024-10-14 07:10:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471052248] [2024-10-14 07:10:16,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:16,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:16,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471052248] [2024-10-14 07:10:16,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471052248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:16,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:16,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-14 07:10:16,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607682028] [2024-10-14 07:10:16,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:16,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 07:10:16,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 07:10:16,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-14 07:10:16,978 INFO L87 Difference]: Start difference. First operand 1902 states and 2702 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:17,207 INFO L93 Difference]: Finished difference Result 3399 states and 4858 transitions. [2024-10-14 07:10:17,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 07:10:17,208 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 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 84 [2024-10-14 07:10:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:17,212 INFO L225 Difference]: With dead ends: 3399 [2024-10-14 07:10:17,212 INFO L226 Difference]: Without dead ends: 1994 [2024-10-14 07:10:17,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-10-14 07:10:17,214 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 72 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:17,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2807 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:10:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-10-14 07:10:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2024-10-14 07:10:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1993 states have (on average 1.4199698946312092) internal successors, (2830), 1993 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2830 transitions. [2024-10-14 07:10:17,240 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2830 transitions. Word has length 84 [2024-10-14 07:10:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:17,240 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 2830 transitions. [2024-10-14 07:10:17,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2830 transitions. [2024-10-14 07:10:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:10:17,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:17,242 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:17,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 07:10:17,242 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1982942795, now seen corresponding path program 1 times [2024-10-14 07:10:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596549517] [2024-10-14 07:10:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:17,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596549517] [2024-10-14 07:10:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596549517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:17,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:17,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 07:10:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274734079] [2024-10-14 07:10:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:17,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 07:10:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:17,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 07:10:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:10:17,793 INFO L87 Difference]: Start difference. First operand 1994 states and 2830 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:18,061 INFO L93 Difference]: Finished difference Result 2899 states and 4140 transitions. [2024-10-14 07:10:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 07:10:18,062 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 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 84 [2024-10-14 07:10:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:18,066 INFO L225 Difference]: With dead ends: 2899 [2024-10-14 07:10:18,066 INFO L226 Difference]: Without dead ends: 1994 [2024-10-14 07:10:18,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-10-14 07:10:18,068 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 128 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:18,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1978 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:10:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-10-14 07:10:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2024-10-14 07:10:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1993 states have (on average 1.4189663823381837) internal successors, (2828), 1993 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2828 transitions. [2024-10-14 07:10:18,091 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2828 transitions. Word has length 84 [2024-10-14 07:10:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:18,091 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 2828 transitions. [2024-10-14 07:10:18,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2828 transitions. [2024-10-14 07:10:18,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:10:18,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:18,093 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:18,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 07:10:18,093 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:18,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:18,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1223948047, now seen corresponding path program 1 times [2024-10-14 07:10:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:18,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914346532] [2024-10-14 07:10:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:18,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:18,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914346532] [2024-10-14 07:10:18,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914346532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:18,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:18,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 07:10:18,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670755415] [2024-10-14 07:10:18,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:18,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 07:10:18,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:18,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 07:10:18,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:10:18,467 INFO L87 Difference]: Start difference. First operand 1994 states and 2828 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:18,570 INFO L93 Difference]: Finished difference Result 3683 states and 5254 transitions. [2024-10-14 07:10:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 07:10:18,571 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 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 84 [2024-10-14 07:10:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:18,575 INFO L225 Difference]: With dead ends: 3683 [2024-10-14 07:10:18,575 INFO L226 Difference]: Without dead ends: 2006 [2024-10-14 07:10:18,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:10:18,577 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 43 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:18,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1433 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2024-10-14 07:10:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2002. [2024-10-14 07:10:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 2001 states have (on average 1.4162918540729634) internal successors, (2834), 2001 states have internal predecessors, (2834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2834 transitions. [2024-10-14 07:10:18,608 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2834 transitions. Word has length 84 [2024-10-14 07:10:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:18,608 INFO L471 AbstractCegarLoop]: Abstraction has 2002 states and 2834 transitions. [2024-10-14 07:10:18,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2834 transitions. [2024-10-14 07:10:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:10:18,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:18,610 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:18,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 07:10:18,610 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:18,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1618460986, now seen corresponding path program 1 times [2024-10-14 07:10:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744153905] [2024-10-14 07:10:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:18,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:18,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744153905] [2024-10-14 07:10:18,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744153905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:18,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:18,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:10:18,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441368868] [2024-10-14 07:10:18,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:18,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:10:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:18,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:10:18,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:10:18,856 INFO L87 Difference]: Start difference. First operand 2002 states and 2834 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:18,941 INFO L93 Difference]: Finished difference Result 3289 states and 4685 transitions. [2024-10-14 07:10:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:10:18,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 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 84 [2024-10-14 07:10:18,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:18,945 INFO L225 Difference]: With dead ends: 3289 [2024-10-14 07:10:18,946 INFO L226 Difference]: Without dead ends: 1964 [2024-10-14 07:10:18,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:10:18,949 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 88 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:18,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 980 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-10-14 07:10:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1960. [2024-10-14 07:10:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 1.4139867279224094) internal successors, (2770), 1959 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2770 transitions. [2024-10-14 07:10:18,977 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2770 transitions. Word has length 84 [2024-10-14 07:10:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:18,977 INFO L471 AbstractCegarLoop]: Abstraction has 1960 states and 2770 transitions. [2024-10-14 07:10:18,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2770 transitions. [2024-10-14 07:10:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:10:18,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:18,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:18,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 07:10:18,979 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:18,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash -7718258, now seen corresponding path program 1 times [2024-10-14 07:10:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:18,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708233759] [2024-10-14 07:10:18,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:18,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708233759] [2024-10-14 07:10:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708233759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:19,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:19,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:10:19,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151863261] [2024-10-14 07:10:19,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:19,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:10:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:19,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:10:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:10:19,256 INFO L87 Difference]: Start difference. First operand 1960 states and 2770 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:19,309 INFO L93 Difference]: Finished difference Result 3695 states and 5268 transitions. [2024-10-14 07:10:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:10:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 84 [2024-10-14 07:10:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:19,314 INFO L225 Difference]: With dead ends: 3695 [2024-10-14 07:10:19,314 INFO L226 Difference]: Without dead ends: 2192 [2024-10-14 07:10:19,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:10:19,316 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 5 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:19,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1014 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2024-10-14 07:10:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2136. [2024-10-14 07:10:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2135 states have (on average 1.4042154566744731) internal successors, (2998), 2135 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2998 transitions. [2024-10-14 07:10:19,350 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2998 transitions. Word has length 84 [2024-10-14 07:10:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:19,351 INFO L471 AbstractCegarLoop]: Abstraction has 2136 states and 2998 transitions. [2024-10-14 07:10:19,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2998 transitions. [2024-10-14 07:10:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:10:19,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:19,353 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:19,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 07:10:19,353 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:19,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1450746286, now seen corresponding path program 1 times [2024-10-14 07:10:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539390799] [2024-10-14 07:10:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:19,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539390799] [2024-10-14 07:10:19,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539390799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:19,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:19,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:10:19,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760616818] [2024-10-14 07:10:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:19,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:10:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:10:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:10:19,650 INFO L87 Difference]: Start difference. First operand 2136 states and 2998 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:19,735 INFO L93 Difference]: Finished difference Result 3740 states and 5303 transitions. [2024-10-14 07:10:19,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:10:19,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 84 [2024-10-14 07:10:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:19,741 INFO L225 Difference]: With dead ends: 3740 [2024-10-14 07:10:19,741 INFO L226 Difference]: Without dead ends: 2274 [2024-10-14 07:10:19,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:10:19,742 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 11 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:19,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1425 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2024-10-14 07:10:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2190. [2024-10-14 07:10:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2189 states have (on average 1.3988122430333485) internal successors, (3062), 2189 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 3062 transitions. [2024-10-14 07:10:19,768 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 3062 transitions. Word has length 84 [2024-10-14 07:10:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:19,768 INFO L471 AbstractCegarLoop]: Abstraction has 2190 states and 3062 transitions. [2024-10-14 07:10:19,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 3062 transitions. [2024-10-14 07:10:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:10:19,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:19,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:19,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 07:10:19,770 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:19,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash -240067284, now seen corresponding path program 1 times [2024-10-14 07:10:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220224608] [2024-10-14 07:10:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220224608] [2024-10-14 07:10:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220224608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 07:10:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664885181] [2024-10-14 07:10:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:20,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 07:10:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:20,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 07:10:20,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:10:20,214 INFO L87 Difference]: Start difference. First operand 2190 states and 3062 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:20,374 INFO L93 Difference]: Finished difference Result 3901 states and 5486 transitions. [2024-10-14 07:10:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 07:10:20,374 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 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 84 [2024-10-14 07:10:20,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:20,380 INFO L225 Difference]: With dead ends: 3901 [2024-10-14 07:10:20,380 INFO L226 Difference]: Without dead ends: 2196 [2024-10-14 07:10:20,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:10:20,382 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 62 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:20,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1741 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2024-10-14 07:10:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2192. [2024-10-14 07:10:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 2191 states have (on average 1.3957097215883159) internal successors, (3058), 2191 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 3058 transitions. [2024-10-14 07:10:20,419 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 3058 transitions. Word has length 84 [2024-10-14 07:10:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:20,419 INFO L471 AbstractCegarLoop]: Abstraction has 2192 states and 3058 transitions. [2024-10-14 07:10:20,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 3058 transitions. [2024-10-14 07:10:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:10:20,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:20,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:20,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 07:10:20,421 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:20,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash -212741439, now seen corresponding path program 1 times [2024-10-14 07:10:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:20,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681345721] [2024-10-14 07:10:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:20,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681345721] [2024-10-14 07:10:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681345721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:20,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:20,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:10:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264172268] [2024-10-14 07:10:20,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:20,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:10:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:10:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:10:20,888 INFO L87 Difference]: Start difference. First operand 2192 states and 3058 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:20,954 INFO L93 Difference]: Finished difference Result 3812 states and 5384 transitions. [2024-10-14 07:10:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:10:20,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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 85 [2024-10-14 07:10:20,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:20,966 INFO L225 Difference]: With dead ends: 3812 [2024-10-14 07:10:20,966 INFO L226 Difference]: Without dead ends: 2300 [2024-10-14 07:10:20,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:10:20,968 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 7 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:20,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1152 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2024-10-14 07:10:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2280. [2024-10-14 07:10:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2279 states have (on average 1.3927161035541904) internal successors, (3174), 2279 states have internal predecessors, (3174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3174 transitions. [2024-10-14 07:10:20,993 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3174 transitions. Word has length 85 [2024-10-14 07:10:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:20,993 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3174 transitions. [2024-10-14 07:10:20,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3174 transitions. [2024-10-14 07:10:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:10:20,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:20,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:20,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 07:10:20,996 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:20,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash -769144329, now seen corresponding path program 1 times [2024-10-14 07:10:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133647085] [2024-10-14 07:10:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:21,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133647085] [2024-10-14 07:10:21,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133647085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:21,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:10:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91911602] [2024-10-14 07:10:21,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:21,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:10:21,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:21,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:10:21,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:10:21,190 INFO L87 Difference]: Start difference. First operand 2280 states and 3174 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:21,272 INFO L93 Difference]: Finished difference Result 4125 states and 5779 transitions. [2024-10-14 07:10:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:10:21,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 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 85 [2024-10-14 07:10:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:21,279 INFO L225 Difference]: With dead ends: 4125 [2024-10-14 07:10:21,280 INFO L226 Difference]: Without dead ends: 2218 [2024-10-14 07:10:21,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:10:21,283 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 41 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:21,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1272 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2024-10-14 07:10:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2214. [2024-10-14 07:10:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2213 states have (on average 1.3935833709896068) internal successors, (3084), 2213 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 3084 transitions. [2024-10-14 07:10:21,304 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 3084 transitions. Word has length 85 [2024-10-14 07:10:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:21,304 INFO L471 AbstractCegarLoop]: Abstraction has 2214 states and 3084 transitions. [2024-10-14 07:10:21,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 3084 transitions. [2024-10-14 07:10:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:10:21,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:21,306 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:21,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 07:10:21,306 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:21,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:21,307 INFO L85 PathProgramCache]: Analyzing trace with hash -554686323, now seen corresponding path program 1 times [2024-10-14 07:10:21,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:21,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139671349] [2024-10-14 07:10:21,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:21,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:21,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:21,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139671349] [2024-10-14 07:10:21,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139671349] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:10:21,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902077844] [2024-10-14 07:10:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:21,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:21,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:10:21,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 07:10:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:21,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-10-14 07:10:21,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:10:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:22,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:10:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:24,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902077844] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 07:10:24,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:10:24,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [11, 26] total 54 [2024-10-14 07:10:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782062631] [2024-10-14 07:10:24,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:24,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 07:10:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 07:10:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2687, Unknown=0, NotChecked=0, Total=2862 [2024-10-14 07:10:24,042 INFO L87 Difference]: Start difference. First operand 2214 states and 3084 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:27,164 INFO L93 Difference]: Finished difference Result 5472 states and 7669 transitions. [2024-10-14 07:10:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-14 07:10:27,164 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 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 85 [2024-10-14 07:10:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:27,169 INFO L225 Difference]: With dead ends: 5472 [2024-10-14 07:10:27,170 INFO L226 Difference]: Without dead ends: 3746 [2024-10-14 07:10:27,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=396, Invalid=7436, Unknown=0, NotChecked=0, Total=7832 [2024-10-14 07:10:27,173 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 356 mSDsluCounter, 5525 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 5851 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:27,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 5851 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 07:10:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2024-10-14 07:10:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 2753. [2024-10-14 07:10:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2752 states have (on average 1.3942587209302326) internal successors, (3837), 2752 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3837 transitions. [2024-10-14 07:10:27,203 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3837 transitions. Word has length 85 [2024-10-14 07:10:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:27,203 INFO L471 AbstractCegarLoop]: Abstraction has 2753 states and 3837 transitions. [2024-10-14 07:10:27,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3837 transitions. [2024-10-14 07:10:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:10:27,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:27,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:27,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 07:10:27,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:27,408 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:27,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash 114921403, now seen corresponding path program 1 times [2024-10-14 07:10:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:27,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495631696] [2024-10-14 07:10:27,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:27,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:27,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495631696] [2024-10-14 07:10:27,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495631696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:27,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 07:10:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356716214] [2024-10-14 07:10:27,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:27,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:10:27,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:27,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:10:27,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:10:27,779 INFO L87 Difference]: Start difference. First operand 2753 states and 3837 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:27,884 INFO L93 Difference]: Finished difference Result 5759 states and 8114 transitions. [2024-10-14 07:10:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:10:27,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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 85 [2024-10-14 07:10:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:27,889 INFO L225 Difference]: With dead ends: 5759 [2024-10-14 07:10:27,889 INFO L226 Difference]: Without dead ends: 3519 [2024-10-14 07:10:27,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:10:27,891 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 72 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:27,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1369 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2024-10-14 07:10:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3409. [2024-10-14 07:10:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3408 states have (on average 1.4022887323943662) internal successors, (4779), 3408 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4779 transitions. [2024-10-14 07:10:27,924 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4779 transitions. Word has length 85 [2024-10-14 07:10:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:27,925 INFO L471 AbstractCegarLoop]: Abstraction has 3409 states and 4779 transitions. [2024-10-14 07:10:27,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4779 transitions. [2024-10-14 07:10:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:10:27,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:27,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:27,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 07:10:27,929 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:27,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1954742786, now seen corresponding path program 1 times [2024-10-14 07:10:27,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:27,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254874268] [2024-10-14 07:10:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254874268] [2024-10-14 07:10:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254874268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:28,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:28,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 07:10:28,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751843984] [2024-10-14 07:10:28,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:28,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:10:28,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:28,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:10:28,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:10:28,203 INFO L87 Difference]: Start difference. First operand 3409 states and 4779 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:28,281 INFO L93 Difference]: Finished difference Result 7303 states and 10294 transitions. [2024-10-14 07:10:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:10:28,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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 85 [2024-10-14 07:10:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:28,289 INFO L225 Difference]: With dead ends: 7303 [2024-10-14 07:10:28,289 INFO L226 Difference]: Without dead ends: 4225 [2024-10-14 07:10:28,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:10:28,293 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 10 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:28,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1507 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2024-10-14 07:10:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 4149. [2024-10-14 07:10:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4149 states, 4148 states have (on average 1.3859691417550626) internal successors, (5749), 4148 states have internal predecessors, (5749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 5749 transitions. [2024-10-14 07:10:28,337 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 5749 transitions. Word has length 85 [2024-10-14 07:10:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:28,337 INFO L471 AbstractCegarLoop]: Abstraction has 4149 states and 5749 transitions. [2024-10-14 07:10:28,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 5749 transitions. [2024-10-14 07:10:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:10:28,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:28,340 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:28,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 07:10:28,340 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:28,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1807668667, now seen corresponding path program 1 times [2024-10-14 07:10:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:28,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084017065] [2024-10-14 07:10:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:28,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:29,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084017065] [2024-10-14 07:10:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084017065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:29,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:29,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 07:10:29,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570496045] [2024-10-14 07:10:29,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:29,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 07:10:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 07:10:29,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:10:29,094 INFO L87 Difference]: Start difference. First operand 4149 states and 5749 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:29,272 INFO L93 Difference]: Finished difference Result 8128 states and 11437 transitions. [2024-10-14 07:10:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 07:10:29,273 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 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 85 [2024-10-14 07:10:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:29,281 INFO L225 Difference]: With dead ends: 8128 [2024-10-14 07:10:29,281 INFO L226 Difference]: Without dead ends: 5721 [2024-10-14 07:10:29,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:10:29,284 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 34 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:29,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1304 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:10:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2024-10-14 07:10:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 5593. [2024-10-14 07:10:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5593 states, 5592 states have (on average 1.4079041487839772) internal successors, (7873), 5592 states have internal predecessors, (7873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 7873 transitions. [2024-10-14 07:10:29,340 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 7873 transitions. Word has length 85 [2024-10-14 07:10:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:29,341 INFO L471 AbstractCegarLoop]: Abstraction has 5593 states and 7873 transitions. [2024-10-14 07:10:29,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 7873 transitions. [2024-10-14 07:10:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:10:29,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:29,343 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:29,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 07:10:29,343 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:29,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 644681463, now seen corresponding path program 1 times [2024-10-14 07:10:29,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:29,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349877011] [2024-10-14 07:10:29,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:30,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:30,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349877011] [2024-10-14 07:10:30,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349877011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:30,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:30,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-14 07:10:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634611345] [2024-10-14 07:10:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:30,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 07:10:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 07:10:30,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-10-14 07:10:30,138 INFO L87 Difference]: Start difference. First operand 5593 states and 7873 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:30,573 INFO L93 Difference]: Finished difference Result 9959 states and 14076 transitions. [2024-10-14 07:10:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 07:10:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 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 85 [2024-10-14 07:10:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:30,582 INFO L225 Difference]: With dead ends: 9959 [2024-10-14 07:10:30,582 INFO L226 Difference]: Without dead ends: 5691 [2024-10-14 07:10:30,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-10-14 07:10:30,587 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 107 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 2962 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:30,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 2962 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:10:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5691 states. [2024-10-14 07:10:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5691 to 5665. [2024-10-14 07:10:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 5664 states have (on average 1.40625) internal successors, (7965), 5664 states have internal predecessors, (7965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 7965 transitions. [2024-10-14 07:10:30,639 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 7965 transitions. Word has length 85 [2024-10-14 07:10:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:30,639 INFO L471 AbstractCegarLoop]: Abstraction has 5665 states and 7965 transitions. [2024-10-14 07:10:30,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 7965 transitions. [2024-10-14 07:10:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:10:30,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:30,642 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:30,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 07:10:30,642 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:30,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:30,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1789282678, now seen corresponding path program 1 times [2024-10-14 07:10:30,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:30,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990873326] [2024-10-14 07:10:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:30,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:30,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990873326] [2024-10-14 07:10:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990873326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:30,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:10:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059146146] [2024-10-14 07:10:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:10:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:10:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:10:30,843 INFO L87 Difference]: Start difference. First operand 5665 states and 7965 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:30,975 INFO L93 Difference]: Finished difference Result 8514 states and 11979 transitions. [2024-10-14 07:10:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 07:10:30,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 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 85 [2024-10-14 07:10:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:30,984 INFO L225 Difference]: With dead ends: 8514 [2024-10-14 07:10:30,985 INFO L226 Difference]: Without dead ends: 5680 [2024-10-14 07:10:31,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:10:31,032 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 165 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:31,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1290 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5680 states. [2024-10-14 07:10:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5680 to 5680. [2024-10-14 07:10:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5679 states have (on average 1.4058813171332982) internal successors, (7984), 5679 states have internal predecessors, (7984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 7984 transitions. [2024-10-14 07:10:31,078 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 7984 transitions. Word has length 85 [2024-10-14 07:10:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:31,078 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 7984 transitions. [2024-10-14 07:10:31,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 7984 transitions. [2024-10-14 07:10:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 07:10:31,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:31,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:31,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 07:10:31,081 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:31,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:31,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1813382841, now seen corresponding path program 1 times [2024-10-14 07:10:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985922846] [2024-10-14 07:10:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:31,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:31,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985922846] [2024-10-14 07:10:31,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985922846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:10:31,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611511552] [2024-10-14 07:10:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:31,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:31,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:31,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:10:31,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 07:10:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:31,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-14 07:10:31,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:10:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:32,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:10:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611511552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:32,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:10:32,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [12] total 40 [2024-10-14 07:10:32,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858986183] [2024-10-14 07:10:32,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:32,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 07:10:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:32,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 07:10:32,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1535, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 07:10:32,842 INFO L87 Difference]: Start difference. First operand 5680 states and 7984 transitions. Second operand has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:33,342 INFO L93 Difference]: Finished difference Result 9978 states and 14097 transitions. [2024-10-14 07:10:33,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 07:10:33,342 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 29 states have internal predecessors, (86), 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 86 [2024-10-14 07:10:33,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:33,349 INFO L225 Difference]: With dead ends: 9978 [2024-10-14 07:10:33,349 INFO L226 Difference]: Without dead ends: 5710 [2024-10-14 07:10:33,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=1612, Unknown=0, NotChecked=0, Total=1722 [2024-10-14 07:10:33,354 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 60 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:33,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3411 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:10:33,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2024-10-14 07:10:33,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 5690. [2024-10-14 07:10:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 5689 states have (on average 1.4062225347161188) internal successors, (8000), 5689 states have internal predecessors, (8000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8000 transitions. [2024-10-14 07:10:33,408 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8000 transitions. Word has length 86 [2024-10-14 07:10:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:33,408 INFO L471 AbstractCegarLoop]: Abstraction has 5690 states and 8000 transitions. [2024-10-14 07:10:33,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8000 transitions. [2024-10-14 07:10:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 07:10:33,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:33,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:33,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 07:10:33,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:33,613 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:33,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash 151033572, now seen corresponding path program 1 times [2024-10-14 07:10:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:33,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268847305] [2024-10-14 07:10:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:34,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:34,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268847305] [2024-10-14 07:10:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268847305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:34,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:34,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 07:10:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88380451] [2024-10-14 07:10:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:34,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 07:10:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:34,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 07:10:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:10:34,058 INFO L87 Difference]: Start difference. First operand 5690 states and 8000 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:34,272 INFO L93 Difference]: Finished difference Result 10561 states and 14938 transitions. [2024-10-14 07:10:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 07:10:34,275 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 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 86 [2024-10-14 07:10:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:34,282 INFO L225 Difference]: With dead ends: 10561 [2024-10-14 07:10:34,282 INFO L226 Difference]: Without dead ends: 5694 [2024-10-14 07:10:34,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-14 07:10:34,286 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 156 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:34,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1745 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states. [2024-10-14 07:10:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5694. [2024-10-14 07:10:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5694 states, 5693 states have (on average 1.4045318812576848) internal successors, (7996), 5693 states have internal predecessors, (7996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 7996 transitions. [2024-10-14 07:10:34,363 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 7996 transitions. Word has length 86 [2024-10-14 07:10:34,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:34,364 INFO L471 AbstractCegarLoop]: Abstraction has 5694 states and 7996 transitions. [2024-10-14 07:10:34,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 7996 transitions. [2024-10-14 07:10:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 07:10:34,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:34,366 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:34,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 07:10:34,366 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash -393884302, now seen corresponding path program 1 times [2024-10-14 07:10:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865908353] [2024-10-14 07:10:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:34,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865908353] [2024-10-14 07:10:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865908353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:34,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:10:34,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775764171] [2024-10-14 07:10:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:34,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:10:34,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:34,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:10:34,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:10:34,477 INFO L87 Difference]: Start difference. First operand 5694 states and 7996 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:34,531 INFO L93 Difference]: Finished difference Result 10804 states and 15229 transitions. [2024-10-14 07:10:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:10:34,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2024-10-14 07:10:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:34,537 INFO L225 Difference]: With dead ends: 10804 [2024-10-14 07:10:34,537 INFO L226 Difference]: Without dead ends: 5584 [2024-10-14 07:10:34,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:10:34,543 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:34,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 652 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5584 states. [2024-10-14 07:10:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5584 to 5584. [2024-10-14 07:10:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5584 states, 5583 states have (on average 1.3967401038867993) internal successors, (7798), 5583 states have internal predecessors, (7798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5584 states to 5584 states and 7798 transitions. [2024-10-14 07:10:34,594 INFO L78 Accepts]: Start accepts. Automaton has 5584 states and 7798 transitions. Word has length 86 [2024-10-14 07:10:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:34,594 INFO L471 AbstractCegarLoop]: Abstraction has 5584 states and 7798 transitions. [2024-10-14 07:10:34,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 5584 states and 7798 transitions. [2024-10-14 07:10:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 07:10:34,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:34,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:34,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 07:10:34,597 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:34,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1458839651, now seen corresponding path program 1 times [2024-10-14 07:10:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:34,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621058635] [2024-10-14 07:10:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:34,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:35,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:35,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621058635] [2024-10-14 07:10:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621058635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:35,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-14 07:10:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139329170] [2024-10-14 07:10:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:35,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 07:10:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:35,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 07:10:35,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-14 07:10:35,269 INFO L87 Difference]: Start difference. First operand 5584 states and 7798 transitions. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:35,517 INFO L93 Difference]: Finished difference Result 9133 states and 12828 transitions. [2024-10-14 07:10:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 07:10:35,517 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 16 states have internal predecessors, (86), 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 86 [2024-10-14 07:10:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:35,523 INFO L225 Difference]: With dead ends: 9133 [2024-10-14 07:10:35,523 INFO L226 Difference]: Without dead ends: 5618 [2024-10-14 07:10:35,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-14 07:10:35,527 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 67 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:35,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 2197 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:10:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2024-10-14 07:10:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 5522. [2024-10-14 07:10:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5522 states, 5521 states have (on average 1.39865966310451) internal successors, (7722), 5521 states have internal predecessors, (7722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 7722 transitions. [2024-10-14 07:10:35,603 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 7722 transitions. Word has length 86 [2024-10-14 07:10:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:35,603 INFO L471 AbstractCegarLoop]: Abstraction has 5522 states and 7722 transitions. [2024-10-14 07:10:35,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 7722 transitions. [2024-10-14 07:10:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 07:10:35,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:35,607 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:35,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 07:10:35,607 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:35,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1871545855, now seen corresponding path program 1 times [2024-10-14 07:10:35,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:35,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928095381] [2024-10-14 07:10:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:36,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:36,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928095381] [2024-10-14 07:10:36,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928095381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:10:36,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145233801] [2024-10-14 07:10:36,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:36,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:10:36,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:36,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:10:36,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 07:10:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:36,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-14 07:10:36,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:10:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:37,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:10:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145233801] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:10:40,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:10:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28, 26] total 72 [2024-10-14 07:10:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276045086] [2024-10-14 07:10:40,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:10:40,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-10-14 07:10:40,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-10-14 07:10:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=4638, Unknown=0, NotChecked=0, Total=5256 [2024-10-14 07:10:40,710 INFO L87 Difference]: Start difference. First operand 5522 states and 7722 transitions. Second operand has 73 states, 73 states have (on average 3.3698630136986303) internal successors, (246), 72 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:51,116 INFO L93 Difference]: Finished difference Result 15780 states and 22221 transitions. [2024-10-14 07:10:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-10-14 07:10:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.3698630136986303) internal successors, (246), 72 states have internal predecessors, (246), 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 86 [2024-10-14 07:10:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:51,128 INFO L225 Difference]: With dead ends: 15780 [2024-10-14 07:10:51,128 INFO L226 Difference]: Without dead ends: 11461 [2024-10-14 07:10:51,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9128 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3199, Invalid=31211, Unknown=0, NotChecked=0, Total=34410 [2024-10-14 07:10:51,138 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 2627 mSDsluCounter, 8624 mSDsCounter, 0 mSdLazyCounter, 4138 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2627 SdHoareTripleChecker+Valid, 8889 SdHoareTripleChecker+Invalid, 4193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:51,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2627 Valid, 8889 Invalid, 4193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4138 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 07:10:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2024-10-14 07:10:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 7157. [2024-10-14 07:10:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7157 states, 7156 states have (on average 1.3993851313583008) internal successors, (10014), 7156 states have internal predecessors, (10014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7157 states to 7157 states and 10014 transitions. [2024-10-14 07:10:51,301 INFO L78 Accepts]: Start accepts. Automaton has 7157 states and 10014 transitions. Word has length 86 [2024-10-14 07:10:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:51,301 INFO L471 AbstractCegarLoop]: Abstraction has 7157 states and 10014 transitions. [2024-10-14 07:10:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.3698630136986303) internal successors, (246), 72 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7157 states and 10014 transitions. [2024-10-14 07:10:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 07:10:51,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:51,303 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:51,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 07:10:51,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-10-14 07:10:51,504 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:51,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:51,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1824345017, now seen corresponding path program 1 times [2024-10-14 07:10:51,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:51,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216896652] [2024-10-14 07:10:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:51,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:51,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216896652] [2024-10-14 07:10:51,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216896652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:51,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:51,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:10:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124345522] [2024-10-14 07:10:51,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:51,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:10:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:51,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:10:51,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:10:51,606 INFO L87 Difference]: Start difference. First operand 7157 states and 10014 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:51,668 INFO L93 Difference]: Finished difference Result 14249 states and 19941 transitions. [2024-10-14 07:10:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:10:51,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2024-10-14 07:10:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:51,675 INFO L225 Difference]: With dead ends: 14249 [2024-10-14 07:10:51,675 INFO L226 Difference]: Without dead ends: 7139 [2024-10-14 07:10:51,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:10:51,681 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:51,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 652 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7139 states. [2024-10-14 07:10:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7139 to 7139. [2024-10-14 07:10:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7139 states, 7138 states have (on average 1.3989913140935837) internal successors, (9986), 7138 states have internal predecessors, (9986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7139 states to 7139 states and 9986 transitions. [2024-10-14 07:10:51,765 INFO L78 Accepts]: Start accepts. Automaton has 7139 states and 9986 transitions. Word has length 86 [2024-10-14 07:10:51,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:51,765 INFO L471 AbstractCegarLoop]: Abstraction has 7139 states and 9986 transitions. [2024-10-14 07:10:51,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 7139 states and 9986 transitions. [2024-10-14 07:10:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 07:10:51,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:51,767 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:51,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-14 07:10:51,768 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:51,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1995978519, now seen corresponding path program 1 times [2024-10-14 07:10:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:51,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910255484] [2024-10-14 07:10:51,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:51,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910255484] [2024-10-14 07:10:52,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910255484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:52,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:52,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 07:10:52,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644896952] [2024-10-14 07:10:52,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:52,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 07:10:52,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:52,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 07:10:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:10:52,363 INFO L87 Difference]: Start difference. First operand 7139 states and 9986 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:52,648 INFO L93 Difference]: Finished difference Result 13019 states and 18328 transitions. [2024-10-14 07:10:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 07:10:52,649 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 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 87 [2024-10-14 07:10:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:52,654 INFO L225 Difference]: With dead ends: 13019 [2024-10-14 07:10:52,654 INFO L226 Difference]: Without dead ends: 7115 [2024-10-14 07:10:52,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2024-10-14 07:10:52,656 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 130 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:52,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1582 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2024-10-14 07:10:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7115. [2024-10-14 07:10:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7115 states, 7114 states have (on average 1.3989316840033736) internal successors, (9952), 7114 states have internal predecessors, (9952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7115 states to 7115 states and 9952 transitions. [2024-10-14 07:10:52,730 INFO L78 Accepts]: Start accepts. Automaton has 7115 states and 9952 transitions. Word has length 87 [2024-10-14 07:10:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:52,730 INFO L471 AbstractCegarLoop]: Abstraction has 7115 states and 9952 transitions. [2024-10-14 07:10:52,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 7115 states and 9952 transitions. [2024-10-14 07:10:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 07:10:52,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:52,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-14 07:10:52,733 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash -903545569, now seen corresponding path program 1 times [2024-10-14 07:10:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174341103] [2024-10-14 07:10:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174341103] [2024-10-14 07:10:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174341103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 07:10:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660283358] [2024-10-14 07:10:53,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 07:10:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:53,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 07:10:53,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:10:53,058 INFO L87 Difference]: Start difference. First operand 7115 states and 9952 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:53,223 INFO L93 Difference]: Finished difference Result 13594 states and 19151 transitions. [2024-10-14 07:10:53,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 07:10:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 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 87 [2024-10-14 07:10:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:53,229 INFO L225 Difference]: With dead ends: 13594 [2024-10-14 07:10:53,229 INFO L226 Difference]: Without dead ends: 7139 [2024-10-14 07:10:53,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:10:53,233 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 54 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:53,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1759 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7139 states. [2024-10-14 07:10:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7139 to 7135. [2024-10-14 07:10:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7135 states, 7134 states have (on average 1.3966918979534624) internal successors, (9964), 7134 states have internal predecessors, (9964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7135 states to 7135 states and 9964 transitions. [2024-10-14 07:10:53,311 INFO L78 Accepts]: Start accepts. Automaton has 7135 states and 9964 transitions. Word has length 87 [2024-10-14 07:10:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:53,311 INFO L471 AbstractCegarLoop]: Abstraction has 7135 states and 9964 transitions. [2024-10-14 07:10:53,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 7135 states and 9964 transitions. [2024-10-14 07:10:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 07:10:53,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:53,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:53,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-14 07:10:53,313 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:53,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2107915820, now seen corresponding path program 1 times [2024-10-14 07:10:53,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:53,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609789843] [2024-10-14 07:10:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:53,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609789843] [2024-10-14 07:10:53,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609789843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:53,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:53,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 07:10:53,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047088694] [2024-10-14 07:10:53,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:53,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 07:10:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:53,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 07:10:53,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:10:53,765 INFO L87 Difference]: Start difference. First operand 7135 states and 9964 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:53,970 INFO L93 Difference]: Finished difference Result 13564 states and 19102 transitions. [2024-10-14 07:10:53,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 07:10:53,971 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 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 87 [2024-10-14 07:10:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:53,977 INFO L225 Difference]: With dead ends: 13564 [2024-10-14 07:10:53,977 INFO L226 Difference]: Without dead ends: 7169 [2024-10-14 07:10:53,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-14 07:10:53,982 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 35 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:53,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1946 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2024-10-14 07:10:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7135. [2024-10-14 07:10:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7135 states, 7134 states have (on average 1.3961312026913373) internal successors, (9960), 7134 states have internal predecessors, (9960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7135 states to 7135 states and 9960 transitions. [2024-10-14 07:10:54,062 INFO L78 Accepts]: Start accepts. Automaton has 7135 states and 9960 transitions. Word has length 87 [2024-10-14 07:10:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:54,062 INFO L471 AbstractCegarLoop]: Abstraction has 7135 states and 9960 transitions. [2024-10-14 07:10:54,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 7135 states and 9960 transitions. [2024-10-14 07:10:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 07:10:54,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:54,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:54,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-14 07:10:54,064 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:54,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash 930824, now seen corresponding path program 1 times [2024-10-14 07:10:54,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:54,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092499729] [2024-10-14 07:10:54,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:54,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092499729] [2024-10-14 07:10:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092499729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:54,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 07:10:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417198574] [2024-10-14 07:10:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:54,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 07:10:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:54,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 07:10:54,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:10:54,435 INFO L87 Difference]: Start difference. First operand 7135 states and 9960 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:54,614 INFO L93 Difference]: Finished difference Result 13887 states and 19519 transitions. [2024-10-14 07:10:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 07:10:54,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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 87 [2024-10-14 07:10:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:54,623 INFO L225 Difference]: With dead ends: 13887 [2024-10-14 07:10:54,623 INFO L226 Difference]: Without dead ends: 9166 [2024-10-14 07:10:54,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:10:54,626 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 73 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:54,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1586 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:10:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9166 states. [2024-10-14 07:10:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9166 to 7851. [2024-10-14 07:10:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7851 states, 7850 states have (on average 1.397452229299363) internal successors, (10970), 7850 states have internal predecessors, (10970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7851 states to 7851 states and 10970 transitions. [2024-10-14 07:10:54,710 INFO L78 Accepts]: Start accepts. Automaton has 7851 states and 10970 transitions. Word has length 87 [2024-10-14 07:10:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:54,710 INFO L471 AbstractCegarLoop]: Abstraction has 7851 states and 10970 transitions. [2024-10-14 07:10:54,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7851 states and 10970 transitions. [2024-10-14 07:10:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 07:10:54,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:54,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:54,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-14 07:10:54,712 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:54,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1599836787, now seen corresponding path program 1 times [2024-10-14 07:10:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:54,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181818220] [2024-10-14 07:10:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181818220] [2024-10-14 07:10:54,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181818220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:54,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:54,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:10:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639204040] [2024-10-14 07:10:54,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:54,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:10:54,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:54,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:10:54,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:10:54,995 INFO L87 Difference]: Start difference. First operand 7851 states and 10970 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:55,092 INFO L93 Difference]: Finished difference Result 15669 states and 21897 transitions. [2024-10-14 07:10:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:10:55,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 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 87 [2024-10-14 07:10:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:55,101 INFO L225 Difference]: With dead ends: 15669 [2024-10-14 07:10:55,101 INFO L226 Difference]: Without dead ends: 7853 [2024-10-14 07:10:55,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:10:55,106 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 110 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:55,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 860 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7853 states. [2024-10-14 07:10:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7853 to 7853. [2024-10-14 07:10:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7853 states, 7852 states have (on average 1.3973509933774835) internal successors, (10972), 7852 states have internal predecessors, (10972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 10972 transitions. [2024-10-14 07:10:55,181 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 10972 transitions. Word has length 87 [2024-10-14 07:10:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:55,181 INFO L471 AbstractCegarLoop]: Abstraction has 7853 states and 10972 transitions. [2024-10-14 07:10:55,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 10972 transitions. [2024-10-14 07:10:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 07:10:55,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:55,182 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:55,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-14 07:10:55,183 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:55,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:55,183 INFO L85 PathProgramCache]: Analyzing trace with hash -320128363, now seen corresponding path program 1 times [2024-10-14 07:10:55,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:55,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370613744] [2024-10-14 07:10:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:10:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:10:55,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:10:55,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370613744] [2024-10-14 07:10:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370613744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:10:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:10:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:10:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726605026] [2024-10-14 07:10:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:10:55,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:10:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:10:55,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:10:55,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:10:55,410 INFO L87 Difference]: Start difference. First operand 7853 states and 10972 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:10:55,480 INFO L93 Difference]: Finished difference Result 15070 states and 21206 transitions. [2024-10-14 07:10:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:10:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 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 88 [2024-10-14 07:10:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:10:55,486 INFO L225 Difference]: With dead ends: 15070 [2024-10-14 07:10:55,486 INFO L226 Difference]: Without dead ends: 7633 [2024-10-14 07:10:55,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:10:55,490 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 77 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:10:55,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 861 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:10:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7633 states. [2024-10-14 07:10:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7633 to 7633. [2024-10-14 07:10:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7633 states, 7632 states have (on average 1.4008123689727463) internal successors, (10691), 7632 states have internal predecessors, (10691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 10691 transitions. [2024-10-14 07:10:55,558 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 10691 transitions. Word has length 88 [2024-10-14 07:10:55,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:10:55,558 INFO L471 AbstractCegarLoop]: Abstraction has 7633 states and 10691 transitions. [2024-10-14 07:10:55,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:10:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 10691 transitions. [2024-10-14 07:10:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 07:10:55,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:10:55,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:55,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-14 07:10:55,559 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:10:55,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:10:55,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1001635075, now seen corresponding path program 1 times [2024-10-14 07:10:55,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:10:55,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539516409] [2024-10-14 07:10:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:10:55,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:10:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:10:55,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:10:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:10:55,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:10:55,756 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:10:55,757 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:10:55,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-14 07:10:55,760 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:10:55,818 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:10:55,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:10:55 BoogieIcfgContainer [2024-10-14 07:10:55,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:10:55,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:10:55,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:10:55,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:10:55,822 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:09:47" (3/4) ... [2024-10-14 07:10:55,823 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:10:55,824 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:10:55,825 INFO L158 Benchmark]: Toolchain (without parser) took 69452.36ms. Allocated memory was 165.7MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 109.8MB in the beginning and 511.4MB in the end (delta: -401.5MB). Peak memory consumption was 754.8MB. Max. memory is 16.1GB. [2024-10-14 07:10:55,825 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 165.7MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:10:55,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.80ms. Allocated memory is still 165.7MB. Free memory was 109.5MB in the beginning and 91.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 07:10:55,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.52ms. Allocated memory is still 165.7MB. Free memory was 91.9MB in the beginning and 80.9MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 07:10:55,825 INFO L158 Benchmark]: Boogie Preprocessor took 121.79ms. Allocated memory is still 165.7MB. Free memory was 80.9MB in the beginning and 74.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 07:10:55,825 INFO L158 Benchmark]: RCFGBuilder took 716.41ms. Allocated memory is still 165.7MB. Free memory was 74.2MB in the beginning and 99.3MB in the end (delta: -25.1MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-10-14 07:10:55,825 INFO L158 Benchmark]: TraceAbstraction took 68210.68ms. Allocated memory was 165.7MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 98.6MB in the beginning and 511.4MB in the end (delta: -412.8MB). Peak memory consumption was 742.0MB. Max. memory is 16.1GB. [2024-10-14 07:10:55,825 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 1.3GB. Free memory is still 511.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:10:55,826 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 165.7MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.80ms. Allocated memory is still 165.7MB. Free memory was 109.5MB in the beginning and 91.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.52ms. Allocated memory is still 165.7MB. Free memory was 91.9MB in the beginning and 80.9MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.79ms. Allocated memory is still 165.7MB. Free memory was 80.9MB in the beginning and 74.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 716.41ms. Allocated memory is still 165.7MB. Free memory was 74.2MB in the beginning and 99.3MB in the end (delta: -25.1MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 68210.68ms. Allocated memory was 165.7MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 98.6MB in the beginning and 511.4MB in the end (delta: -412.8MB). Peak memory consumption was 742.0MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 1.3GB. Free memory is still 511.4MB. 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 173, overapproximation of bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_30 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_34; [L49] SORT_12 input_36; [L50] SORT_3 input_38; [L51] SORT_12 input_100; [L52] SORT_3 input_102; [L53] SORT_1 input_105; [L54] SORT_3 input_107; [L55] SORT_3 input_109; [L56] SORT_3 input_111; [L57] SORT_3 input_113; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_34 = __VERIFIER_nondet_uchar() [L85] input_36 = __VERIFIER_nondet_uchar() [L86] input_38 = __VERIFIER_nondet_uchar() [L87] input_100 = __VERIFIER_nondet_uchar() [L88] input_102 = __VERIFIER_nondet_uchar() [L89] input_105 = __VERIFIER_nondet_uchar() [L90] input_107 = __VERIFIER_nondet_uchar() [L91] input_109 = __VERIFIER_nondet_uchar() [L92] input_111 = __VERIFIER_nondet_uchar() [L93] input_113 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_30=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_30=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = state_24; [L105] SORT_3 var_26 = ~var_26_arg_0; [L106] SORT_3 var_27_arg_0 = var_23; [L107] SORT_3 var_27_arg_1 = var_26; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_27_arg_0=-1, var_27_arg_1=-1, var_30=1] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L108] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_3 var_31_arg_0 = var_27; [L110] SORT_3 var_31 = ~var_31_arg_0; [L111] SORT_3 var_32_arg_0 = var_30; [L112] SORT_3 var_32_arg_1 = var_31; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_32_arg_0=1, var_32_arg_1=-256] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L113] SORT_3 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L114] var_32 = var_32 & mask_SORT_3 [L115] SORT_3 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND FALSE !(!(cond)) [L116] RET __VERIFIER_assert(!(bad_33_arg_0)) [L118] SORT_3 var_40_arg_0 = state_17; [L119] SORT_3 var_40 = ~var_40_arg_0; [L120] SORT_3 var_41_arg_0 = state_15; [L121] SORT_3 var_41 = ~var_41_arg_0; [L122] SORT_3 var_42_arg_0 = var_41; [L123] SORT_3 var_42_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_42_arg_0=-1, var_42_arg_1=0] [L124] EXPR var_42_arg_0 & var_42_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1] [L124] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L125] SORT_3 var_43_arg_0 = var_42; [L126] SORT_3 var_43 = ~var_43_arg_0; [L127] SORT_3 var_44_arg_0 = var_40; [L128] SORT_3 var_44_arg_1 = var_43; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_44_arg_0=-1, var_44_arg_1=-1] [L129] EXPR var_44_arg_0 | var_44_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1] [L129] SORT_3 var_44 = var_44_arg_0 | var_44_arg_1; [L130] SORT_3 var_45_arg_0 = var_44; [L131] SORT_3 var_45 = ~var_45_arg_0; [L132] SORT_3 var_46_arg_0 = state_17; [L133] SORT_3 var_46_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_45=-256, var_46_arg_0=0, var_46_arg_1=0] [L134] EXPR var_46_arg_0 & var_46_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_45=-256] [L134] SORT_3 var_46 = var_46_arg_0 & var_46_arg_1; [L135] SORT_3 var_47_arg_0 = var_41; [L136] SORT_3 var_47_arg_1 = var_46; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_45=-256, var_47_arg_0=-1, var_47_arg_1=0] [L137] EXPR var_47_arg_0 | var_47_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_45=-256] [L137] SORT_3 var_47 = var_47_arg_0 | var_47_arg_1; [L138] SORT_3 var_48_arg_0 = var_47; [L139] SORT_3 var_48 = ~var_48_arg_0; [L140] SORT_3 var_49_arg_0 = var_45; [L141] SORT_3 var_49_arg_1 = var_48; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_49_arg_0=-256, var_49_arg_1=-256] [L142] EXPR var_49_arg_0 | var_49_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1] [L142] SORT_3 var_49 = var_49_arg_0 | var_49_arg_1; [L143] SORT_3 next_115_arg_1 = var_49; [L144] SORT_3 var_51_arg_0 = state_20; [L145] SORT_3 var_51 = ~var_51_arg_0; [L146] SORT_3 var_52_arg_0 = state_17; [L147] SORT_3 var_52_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52_arg_0=0, var_52_arg_1=-1] [L148] EXPR var_52_arg_0 | var_52_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1] [L148] SORT_3 var_52 = var_52_arg_0 | var_52_arg_1; [L149] SORT_3 var_53_arg_0 = state_17; [L150] SORT_3 var_53_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52=255, var_53_arg_0=0, var_53_arg_1=-1] [L151] EXPR var_53_arg_0 & var_53_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52=255] [L151] SORT_3 var_53 = var_53_arg_0 & var_53_arg_1; [L152] SORT_3 var_54_arg_0 = var_53; [L153] SORT_3 var_54 = ~var_54_arg_0; [L154] SORT_3 var_55_arg_0 = var_52; [L155] SORT_3 var_55_arg_1 = var_54; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_55_arg_0=255, var_55_arg_1=-1] [L156] EXPR var_55_arg_0 & var_55_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1] [L156] SORT_3 var_55 = var_55_arg_0 & var_55_arg_1; [L157] SORT_3 var_56_arg_0 = var_55; [L158] SORT_3 var_56 = ~var_56_arg_0; [L159] SORT_3 next_116_arg_1 = var_56; [L160] SORT_1 var_58_arg_0 = input_2; [L161] SORT_3 var_58 = var_58_arg_0 >> 0; [L162] SORT_1 var_59_arg_0 = input_2; [L163] SORT_3 var_59 = var_59_arg_0 >> 2; [L164] SORT_3 var_60_arg_0 = var_59; [L165] SORT_3 var_60 = ~var_60_arg_0; [L166] SORT_1 var_61_arg_0 = input_2; [L167] SORT_3 var_61 = var_61_arg_0 >> 1; [L168] SORT_3 var_62_arg_0 = var_60; [L169] SORT_3 var_62_arg_1 = var_61; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62_arg_0=-1, var_62_arg_1=0] [L170] EXPR var_62_arg_0 | var_62_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1] [L170] SORT_3 var_62 = var_62_arg_0 | var_62_arg_1; [L171] SORT_3 var_63_arg_0 = var_58; [L172] SORT_3 var_63_arg_1 = var_62; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_63_arg_0=1, var_63_arg_1=255] [L173] EXPR var_63_arg_0 | var_63_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255] [L173] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L174] SORT_3 var_64_arg_0 = var_63; [L175] SORT_3 var_64 = ~var_64_arg_0; [L176] SORT_3 var_65_arg_0 = state_15; [L177] SORT_3 var_65_arg_1 = state_17; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_64=-1, var_65_arg_0=0, var_65_arg_1=0] [L178] EXPR var_65_arg_0 | var_65_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_64=-1] [L178] SORT_3 var_65 = var_65_arg_0 | var_65_arg_1; [L179] SORT_3 var_66_arg_0 = var_64; [L180] SORT_3 var_66_arg_1 = var_65; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_65=0, var_66_arg_0=-1, var_66_arg_1=0] [L181] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_65=0] [L181] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L182] SORT_3 var_67_arg_0 = var_66; [L183] SORT_3 var_67_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0, var_67_arg_0=255, var_67_arg_1=-1] [L184] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0] [L184] SORT_3 var_67 = var_67_arg_0 & var_67_arg_1; [L185] SORT_3 next_117_arg_1 = var_67; [L186] SORT_3 var_69_arg_0 = state_15; [L187] SORT_3 var_69_arg_1 = state_20; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0, var_69_arg_0=0, var_69_arg_1=0] [L188] EXPR var_69_arg_0 & var_69_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0] [L188] SORT_3 var_69 = var_69_arg_0 & var_69_arg_1; [L189] SORT_3 var_70_arg_0 = var_69; [L190] SORT_3 var_70 = ~var_70_arg_0; [L191] SORT_3 var_71_arg_0 = var_40; [L192] SORT_3 var_71_arg_1 = var_70; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_58=1, var_62=255, var_65=0, var_71_arg_0=-1, var_71_arg_1=-1] [L193] EXPR var_71_arg_0 | var_71_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_58=1, var_62=255, var_65=0] [L193] SORT_3 var_71 = var_71_arg_0 | var_71_arg_1; [L194] SORT_3 var_72_arg_0 = var_71; [L195] SORT_3 var_72 = ~var_72_arg_0; [L196] SORT_3 var_73_arg_0 = state_20; [L197] SORT_3 var_73_arg_1 = var_65; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_58=1, var_62=255, var_72=-256, var_73_arg_0=0, var_73_arg_1=0] [L198] EXPR var_73_arg_0 | var_73_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_58=1, var_62=255, var_72=-256] [L198] SORT_3 var_73 = var_73_arg_0 | var_73_arg_1; [L199] SORT_3 var_74_arg_0 = var_73; [L200] SORT_3 var_74 = ~var_74_arg_0; [L201] SORT_3 var_75_arg_0 = var_58; [L202] SORT_3 var_75_arg_1 = var_74; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_72=-256, var_74=-1, var_75_arg_0=1, var_75_arg_1=-1] [L203] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_72=-256, var_74=-1] [L203] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L204] SORT_3 var_76_arg_0 = var_75; [L205] SORT_3 var_76 = ~var_76_arg_0; [L206] SORT_3 var_77_arg_0 = var_76; [L207] SORT_3 var_77 = ~var_77_arg_0; [L208] SORT_3 var_78_arg_0 = var_72; [L209] SORT_3 var_78_arg_1 = var_77; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_74=-1, var_78_arg_0=-256, var_78_arg_1=-256] [L210] EXPR var_78_arg_0 | var_78_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_74=-1] [L210] SORT_3 var_78 = var_78_arg_0 | var_78_arg_1; [L211] SORT_3 var_79_arg_0 = var_62; [L212] SORT_3 var_79_arg_1 = var_74; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_78=0, var_79_arg_0=255, var_79_arg_1=-1] [L213] EXPR var_79_arg_0 & var_79_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_78=0] [L213] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L214] SORT_3 var_80_arg_0 = var_78; [L215] SORT_3 var_80_arg_1 = var_79; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_80_arg_0=0, var_80_arg_1=255] [L216] EXPR var_80_arg_0 | var_80_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1] [L216] SORT_3 var_80 = var_80_arg_0 | var_80_arg_1; [L217] SORT_3 next_118_arg_1 = var_80; [L219] state_15 = next_115_arg_1 [L220] state_17 = next_116_arg_1 [L221] state_20 = next_117_arg_1 [L222] state_24 = next_118_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_34 = __VERIFIER_nondet_uchar() [L85] input_36 = __VERIFIER_nondet_uchar() [L86] input_38 = __VERIFIER_nondet_uchar() [L87] input_100 = __VERIFIER_nondet_uchar() [L88] input_102 = __VERIFIER_nondet_uchar() [L89] input_105 = __VERIFIER_nondet_uchar() [L90] input_107 = __VERIFIER_nondet_uchar() [L91] input_109 = __VERIFIER_nondet_uchar() [L92] input_111 = __VERIFIER_nondet_uchar() [L93] input_113 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_19_arg_0=0, var_19_arg_1=-256, var_30=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_30=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_22_arg_0=0, var_22_arg_1=255, var_30=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_30=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = state_24; [L105] SORT_3 var_26 = ~var_26_arg_0; [L106] SORT_3 var_27_arg_0 = var_23; [L107] SORT_3 var_27_arg_1 = var_26; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_27_arg_0=-256, var_27_arg_1=-256, var_30=1] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L108] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_3 var_31_arg_0 = var_27; [L110] SORT_3 var_31 = ~var_31_arg_0; [L111] SORT_3 var_32_arg_0 = var_30; [L112] SORT_3 var_32_arg_1 = var_31; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1, var_32_arg_0=1, var_32_arg_1=-1] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L113] SORT_3 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L114] var_32 = var_32 & mask_SORT_3 [L115] SORT_3 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.1s, OverallIterations: 49, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9000 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9000 mSDsluCounter, 85136 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76777 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20392 IncrementalHoareTripleChecker+Invalid, 20554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 8359 mSDtfsCounter, 20392 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2082 GetRequests, 1002 SyntacticMatches, 23 SemanticMatches, 1057 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20342 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7853occurred in iteration=47, InterpolantAutomatonStates: 769, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 48 MinimizatonAttempts, 8364 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 32.7s InterpolantComputationTime, 4375 NumberOfCodeBlocks, 4375 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 4807 ConstructedInterpolants, 0 QuantifiedInterpolants, 34668 SizeOfPredicates, 60 NumberOfNonLiveVariables, 3767 ConjunctsInSsa, 807 ConjunctsInUnsatCore, 63 InterpolantComputations, 44 PerfectInterpolantSequences, 578/672 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:10:55,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:10:57,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:10:57,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 07:10:57,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:10:57,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:10:57,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:10:57,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:10:57,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:10:57,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:10:57,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:10:57,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:10:57,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:10:57,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:10:57,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:10:57,799 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:10:57,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:10:57,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:10:57,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:10:57,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:10:57,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:10:57,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:10:57,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:10:57,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:10:57,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:10:57,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:10:57,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:10:57,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:10:57,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:10:57,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:10:57,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:10:57,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:10:57,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:10:57,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:10:57,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:10:57,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:10:57,806 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:10:57,806 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:10:57,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:10:57,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:10:57,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:10:57,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:10:57,809 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:10:57,809 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c [2024-10-14 07:10:58,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:10:58,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:10:58,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:10:58,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:10:58,072 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:10:58,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-14 07:10:59,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:10:59,525 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:10:59,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-14 07:10:59,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2a8a66a/80d5931131f042a590e5aacf2268338c/FLAG473ac3cf4 [2024-10-14 07:10:59,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2a8a66a/80d5931131f042a590e5aacf2268338c [2024-10-14 07:10:59,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:10:59,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:10:59,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:10:59,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:10:59,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:10:59,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3434a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59, skipping insertion in model container [2024-10-14 07:10:59,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:10:59,716 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.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-10-14 07:10:59,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:10:59,780 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:10:59,788 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.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-10-14 07:10:59,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:10:59,831 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:10:59,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59 WrapperNode [2024-10-14 07:10:59,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:10:59,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:10:59,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:10:59,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:10:59,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,875 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2024-10-14 07:10:59,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:10:59,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:10:59,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:10:59,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:10:59,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,916 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-14 07:10:59,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:10:59,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:10:59,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:10:59,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:10:59,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (1/1) ... [2024-10-14 07:10:59,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:10:59,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:10:59,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:10:59,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:10:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:10:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:10:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:10:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:11:00,085 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:11:00,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:11:00,285 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-14 07:11:00,285 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:11:00,321 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:11:00,321 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:11:00,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:11:00 BoogieIcfgContainer [2024-10-14 07:11:00,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:11:00,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:11:00,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:11:00,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:11:00,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:10:59" (1/3) ... [2024-10-14 07:11:00,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd3bfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:11:00, skipping insertion in model container [2024-10-14 07:11:00,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:10:59" (2/3) ... [2024-10-14 07:11:00,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd3bfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:11:00, skipping insertion in model container [2024-10-14 07:11:00,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:11:00" (3/3) ... [2024-10-14 07:11:00,330 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-14 07:11:00,345 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:11:00,345 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:11:00,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:11:00,401 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;@911f53b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:11:00,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:11:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 07:11:00,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:11:00,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 07:11:00,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:11:00,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:11:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 07:11:00,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:11:00,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528050983] [2024-10-14 07:11:00,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:11:00,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:11:00,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:11:00,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:11:00,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:11:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:11:00,531 WARN L253 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 07:11:00,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:11:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:11:00,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:11:00,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:11:00,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528050983] [2024-10-14 07:11:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528050983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:11:00,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:11:00,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:11:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077774360] [2024-10-14 07:11:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:11:00,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:11:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:11:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:11:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:11:00,753 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:11:00,804 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 07:11:00,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:11:00,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 07:11:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:11:00,812 INFO L225 Difference]: With dead ends: 15 [2024-10-14 07:11:00,812 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 07:11:00,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:11:00,816 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-14 07:11:00,817 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-14 07:11:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 07:11:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 07:11:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 07:11:00,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 07:11:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:11:00,850 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 07:11:00,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 07:11:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 07:11:00,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:11:00,852 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 07:11:00,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 07:11:01,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:11:01,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:11:01,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:11:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 07:11:01,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:11:01,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478002610] [2024-10-14 07:11:01,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:11:01,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:11:01,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:11:01,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:11:01,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:11:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:11:01,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 07:11:01,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:11:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:11:01,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:11:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:11:01,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:11:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478002610] [2024-10-14 07:11:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478002610] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 07:11:01,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:11:01,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-14 07:11:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989867438] [2024-10-14 07:11:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:11:01,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:11:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:11:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:11:01,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:11:01,412 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:11:01,435 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2024-10-14 07:11:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:11:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 07:11:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:11:01,436 INFO L225 Difference]: With dead ends: 8 [2024-10-14 07:11:01,436 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 07:11:01,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:11:01,437 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:11:01,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:11:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 07:11:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 07:11:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 07:11:01,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2024-10-14 07:11:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:11:01,439 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 07:11:01,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 07:11:01,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 07:11:01,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:11:01,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 07:11:01,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:11:01,646 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-14 07:11:01,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 07:11:01,669 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:11:01,675 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 07:11:01,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:11:01 BoogieIcfgContainer [2024-10-14 07:11:01,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:11:01,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:11:01,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:11:01,680 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:11:01,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:11:00" (3/4) ... [2024-10-14 07:11:01,681 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 07:11:01,689 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-14 07:11:01,690 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 07:11:01,690 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 07:11:01,691 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 07:11:01,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 07:11:01,821 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 07:11:01,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:11:01,821 INFO L158 Benchmark]: Toolchain (without parser) took 2266.56ms. Allocated memory was 62.9MB in the beginning and 107.0MB in the end (delta: 44.0MB). Free memory was 43.4MB in the beginning and 78.6MB in the end (delta: -35.2MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-10-14 07:11:01,822 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 48.2MB. Free memory is still 29.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:11:01,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.51ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 27.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 07:11:01,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.24ms. Allocated memory is still 62.9MB. Free memory was 27.2MB in the beginning and 24.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:11:01,823 INFO L158 Benchmark]: Boogie Preprocessor took 56.01ms. Allocated memory is still 62.9MB. Free memory was 24.4MB in the beginning and 41.0MB in the end (delta: -16.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:11:01,823 INFO L158 Benchmark]: RCFGBuilder took 388.93ms. Allocated memory is still 62.9MB. Free memory was 41.0MB in the beginning and 31.8MB in the end (delta: 9.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-10-14 07:11:01,824 INFO L158 Benchmark]: TraceAbstraction took 1354.31ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 31.0MB in the beginning and 33.2MB in the end (delta: -2.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 07:11:01,824 INFO L158 Benchmark]: Witness Printer took 141.61ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 33.2MB in the beginning and 78.6MB in the end (delta: -45.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:11:01,826 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.12ms. Allocated memory is still 48.2MB. Free memory is still 29.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.51ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 27.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.24ms. Allocated memory is still 62.9MB. Free memory was 27.2MB in the beginning and 24.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.01ms. Allocated memory is still 62.9MB. Free memory was 24.4MB in the beginning and 41.0MB in the end (delta: -16.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 388.93ms. Allocated memory is still 62.9MB. Free memory was 41.0MB in the beginning and 31.8MB in the end (delta: 9.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1354.31ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 31.0MB in the beginning and 33.2MB in the end (delta: -2.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 141.61ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 33.2MB in the beginning and 78.6MB in the end (delta: -45.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=1, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 2 QuantifiedInterpolants, 199 SizeOfPredicates, 9 NumberOfNonLiveVariables, 108 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-14 07:11:01,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE