./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:50:54,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:50:54,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:50:54,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:50:54,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:50:54,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:50:54,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:50:54,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:50:54,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:50:54,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:50:54,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:50:54,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:50:54,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:50:54,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:50:54,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:50:54,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:50:54,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:50:54,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:50:54,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:50:54,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:50:54,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:50:54,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:50:54,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:50:54,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:50:54,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:50:54,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:50:54,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:50:54,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:50:54,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:50:54,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:50:54,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:50:54,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:50:54,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:50:54,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:50:54,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:50:54,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:50:54,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:50:54,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:50:54,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:50:54,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:50:54,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:50:54,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:50:54,579 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2024-11-08 13:50:54,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:50:54,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:50:54,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:50:54,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:50:54,855 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:50:54,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2024-11-08 13:50:56,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:50:56,621 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:50:56,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-11-08 13:50:56,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6e3eb5a/0a1be40ef73d4a33b1d226c41e507ed0/FLAG2fa26147f [2024-11-08 13:50:56,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6e3eb5a/0a1be40ef73d4a33b1d226c41e507ed0 [2024-11-08 13:50:56,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:50:56,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:50:56,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:50:56,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:50:56,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:50:56,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:50:56" (1/1) ... [2024-11-08 13:50:56,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df08b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:56, skipping insertion in model container [2024-11-08 13:50:56,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:50:56" (1/1) ... [2024-11-08 13:50:56,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:50:56,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2024-11-08 13:50:57,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:50:57,091 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:50:57,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2024-11-08 13:50:57,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:50:57,166 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:50:57,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57 WrapperNode [2024-11-08 13:50:57,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:50:57,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:50:57,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:50:57,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:50:57,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,205 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 88 [2024-11-08 13:50:57,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:50:57,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:50:57,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:50:57,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:50:57,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,242 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-08 13:50:57,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:50:57,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:50:57,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:50:57,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:50:57,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (1/1) ... [2024-11-08 13:50:57,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:50:57,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:57,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:50:57,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2024-11-08 13:50:57,358 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2024-11-08 13:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 13:50:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 13:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:50:57,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:50:57,502 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:50:57,504 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:50:57,742 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-08 13:50:57,743 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:50:57,756 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:50:57,757 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 13:50:57,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:50:57 BoogieIcfgContainer [2024-11-08 13:50:57,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:50:57,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:50:57,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:50:57,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:50:57,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:50:56" (1/3) ... [2024-11-08 13:50:57,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3742f2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:50:57, skipping insertion in model container [2024-11-08 13:50:57,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:57" (2/3) ... [2024-11-08 13:50:57,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3742f2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:50:57, skipping insertion in model container [2024-11-08 13:50:57,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:50:57" (3/3) ... [2024-11-08 13:50:57,772 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2024-11-08 13:50:57,790 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:50:57,791 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:50:57,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:50:57,860 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;@218ed0ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:50:57,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:50:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:50:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:50:57,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:57,870 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] [2024-11-08 13:50:57,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:57,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash 329443655, now seen corresponding path program 1 times [2024-11-08 13:50:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:57,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363967639] [2024-11-08 13:50:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:50:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:58,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363967639] [2024-11-08 13:50:58,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363967639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:58,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:58,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:50:58,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997158475] [2024-11-08 13:50:58,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:58,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:50:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:58,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:50:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:50:58,188 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:50:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:58,205 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2024-11-08 13:50:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:50:58,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-08 13:50:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:58,215 INFO L225 Difference]: With dead ends: 79 [2024-11-08 13:50:58,215 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:50:58,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:50:58,225 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:58,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:50:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:50:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 13:50:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:50:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-08 13:50:58,266 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 20 [2024-11-08 13:50:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:58,268 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-08 13:50:58,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:50:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-08 13:50:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 13:50:58,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:58,272 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] [2024-11-08 13:50:58,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:50:58,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:58,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash -654440058, now seen corresponding path program 1 times [2024-11-08 13:50:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:58,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249570893] [2024-11-08 13:50:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:58,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 13:50:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:58,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:58,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249570893] [2024-11-08 13:50:58,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249570893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:58,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:58,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:50:58,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596316973] [2024-11-08 13:50:58,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:58,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:50:58,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:58,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:50:58,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:50:58,559 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:50:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:58,629 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2024-11-08 13:50:58,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:50:58,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-08 13:50:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:58,634 INFO L225 Difference]: With dead ends: 47 [2024-11-08 13:50:58,634 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 13:50:58,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-11-08 13:50:58,637 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:58,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 189 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:50:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 13:50:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-08 13:50:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 35 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:50:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2024-11-08 13:50:58,656 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 21 [2024-11-08 13:50:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:58,660 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2024-11-08 13:50:58,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:50:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2024-11-08 13:50:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:50:58,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:58,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:58,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:50:58,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:58,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:58,666 INFO L85 PathProgramCache]: Analyzing trace with hash -698021828, now seen corresponding path program 1 times [2024-11-08 13:50:58,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:58,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128674349] [2024-11-08 13:50:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:58,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 13:50:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:58,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:50:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 13:50:58,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:58,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128674349] [2024-11-08 13:50:58,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128674349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:50:58,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:50:58,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:50:58,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027937988] [2024-11-08 13:50:58,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:50:58,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:50:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:58,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:50:58,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:50:58,884 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:50:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:58,937 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2024-11-08 13:50:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:50:58,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-08 13:50:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:58,939 INFO L225 Difference]: With dead ends: 90 [2024-11-08 13:50:58,939 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 13:50:58,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:50:58,944 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:58,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:50:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 13:50:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2024-11-08 13:50:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 48 states have internal predecessors, (62), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 13:50:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-08 13:50:58,957 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 27 [2024-11-08 13:50:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:58,957 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-08 13:50:58,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:50:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-08 13:50:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 13:50:58,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:58,960 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 13:50:58,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:50:58,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:58,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:58,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1050140346, now seen corresponding path program 1 times [2024-11-08 13:50:58,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:58,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844899761] [2024-11-08 13:50:58,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:58,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:50:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:59,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:50:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:50:59,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:59,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844899761] [2024-11-08 13:50:59,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844899761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:50:59,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738316080] [2024-11-08 13:50:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:59,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:59,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:59,232 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-11-08 13:50:59,234 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-11-08 13:50:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:59,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 13:50:59,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:50:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:59,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:50:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:50:59,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738316080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:50:59,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:50:59,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-08 13:50:59,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215318252] [2024-11-08 13:50:59,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:50:59,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 13:50:59,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:59,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 13:50:59,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:50:59,759 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:51:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:00,132 INFO L93 Difference]: Finished difference Result 107 states and 149 transitions. [2024-11-08 13:51:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 13:51:00,133 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 32 [2024-11-08 13:51:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:00,135 INFO L225 Difference]: With dead ends: 107 [2024-11-08 13:51:00,136 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 13:51:00,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-08 13:51:00,138 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 81 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:00,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 521 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 13:51:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 13:51:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-11-08 13:51:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 56 states have internal predecessors, (70), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-08 13:51:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2024-11-08 13:51:00,150 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 32 [2024-11-08 13:51:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:00,150 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2024-11-08 13:51:00,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:51:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2024-11-08 13:51:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:51:00,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:00,152 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 13:51:00,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:51:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:00,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:00,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash 94816722, now seen corresponding path program 1 times [2024-11-08 13:51:00,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:00,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306422460] [2024-11-08 13:51:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:00,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:51:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:00,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:51:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:51:00,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:00,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306422460] [2024-11-08 13:51:00,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306422460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:00,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:00,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 13:51:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107060477] [2024-11-08 13:51:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:00,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:51:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:00,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:51:00,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:51:00,588 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 13:51:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:00,648 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2024-11-08 13:51:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:51:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-08 13:51:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:00,650 INFO L225 Difference]: With dead ends: 78 [2024-11-08 13:51:00,650 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 13:51:00,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:51:00,651 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:00,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 300 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:51:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 13:51:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-11-08 13:51:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 62 states have internal predecessors, (75), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2024-11-08 13:51:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2024-11-08 13:51:00,663 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 34 [2024-11-08 13:51:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:00,664 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2024-11-08 13:51:00,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 13:51:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2024-11-08 13:51:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 13:51:00,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:00,665 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 13:51:00,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:51:00,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:00,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1911567681, now seen corresponding path program 1 times [2024-11-08 13:51:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931006549] [2024-11-08 13:51:00,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 13:51:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:51:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 13:51:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 13:51:01,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:01,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931006549] [2024-11-08 13:51:01,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931006549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:01,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:01,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 13:51:01,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551114611] [2024-11-08 13:51:01,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:01,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:51:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:01,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:51:01,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:51:01,133 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:51:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:01,269 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2024-11-08 13:51:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:51:01,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-08 13:51:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:01,271 INFO L225 Difference]: With dead ends: 126 [2024-11-08 13:51:01,271 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 13:51:01,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:51:01,273 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 170 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-11-08 13:51:01,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 170 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:51:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 13:51:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2024-11-08 13:51:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 71 states have internal predecessors, (87), 12 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-08 13:51:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-08 13:51:01,287 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 36 [2024-11-08 13:51:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:01,287 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-08 13:51:01,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:51:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-08 13:51:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 13:51:01,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:01,289 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 13:51:01,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:51:01,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:01,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1692712963, now seen corresponding path program 1 times [2024-11-08 13:51:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:01,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711140171] [2024-11-08 13:51:01,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:01,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 13:51:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:51:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 13:51:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 13:51:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711140171] [2024-11-08 13:51:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711140171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:01,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 13:51:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532125724] [2024-11-08 13:51:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:01,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:51:01,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:51:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:51:01,424 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:51:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:01,458 INFO L93 Difference]: Finished difference Result 92 states and 127 transitions. [2024-11-08 13:51:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:51:01,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-08 13:51:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:01,461 INFO L225 Difference]: With dead ends: 92 [2024-11-08 13:51:01,462 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 13:51:01,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-11-08 13:51:01,463 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 254 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-11-08 13:51:01,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 254 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:51:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 13:51:01,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2024-11-08 13:51:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 61 states have internal predecessors, (77), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-08 13:51:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2024-11-08 13:51:01,485 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 36 [2024-11-08 13:51:01,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:01,485 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2024-11-08 13:51:01,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:51:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-11-08 13:51:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:51:01,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:01,487 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 13:51:01,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 13:51:01,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:01,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1295305490, now seen corresponding path program 1 times [2024-11-08 13:51:01,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:01,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797590681] [2024-11-08 13:51:01,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:01,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 13:51:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:51:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 13:51:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:51:01,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:01,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797590681] [2024-11-08 13:51:01,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797590681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:01,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:01,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:51:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311450047] [2024-11-08 13:51:01,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:01,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:51:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:51:01,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:51:01,641 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:51:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:01,724 INFO L93 Difference]: Finished difference Result 123 states and 166 transitions. [2024-11-08 13:51:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:51:01,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-08 13:51:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:01,727 INFO L225 Difference]: With dead ends: 123 [2024-11-08 13:51:01,727 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 13:51:01,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-11-08 13:51:01,729 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:01,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 163 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:51:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 13:51:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-08 13:51:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 44 states have internal predecessors, (53), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-08 13:51:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2024-11-08 13:51:01,737 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 37 [2024-11-08 13:51:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:01,738 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2024-11-08 13:51:01,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:51:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2024-11-08 13:51:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 13:51:01,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:01,739 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-08 13:51:01,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 13:51:01,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:01,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash 569979573, now seen corresponding path program 1 times [2024-11-08 13:51:01,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:01,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582665395] [2024-11-08 13:51:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:51:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:51:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:51:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 13:51:01,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:01,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582665395] [2024-11-08 13:51:01,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582665395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:01,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230874074] [2024-11-08 13:51:01,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:01,895 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-11-08 13:51:01,897 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-11-08 13:51:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:02,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 13:51:02,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:02,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-08 13:51:02,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:02,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-08 13:51:02,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-08 13:51:02,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:02,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-08 13:51:02,501 INFO L349 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2024-11-08 13:51:02,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 57 [2024-11-08 13:51:02,520 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 13:51:02,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 13:51:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 13:51:02,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:02,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-08 13:51:02,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:02,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-08 13:51:02,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:02,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2024-11-08 13:51:02,795 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-08 13:51:02,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-08 13:51:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 13:51:02,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230874074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:02,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:02,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 7] total 16 [2024-11-08 13:51:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349314942] [2024-11-08 13:51:02,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:02,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 13:51:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:02,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 13:51:02,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:51:02,833 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 13:51:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:03,578 INFO L93 Difference]: Finished difference Result 162 states and 215 transitions. [2024-11-08 13:51:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 13:51:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2024-11-08 13:51:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:03,581 INFO L225 Difference]: With dead ends: 162 [2024-11-08 13:51:03,581 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 13:51:03,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2024-11-08 13:51:03,583 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 135 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:03,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 634 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 13:51:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 13:51:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2024-11-08 13:51:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 79 states have internal predecessors, (94), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-08 13:51:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2024-11-08 13:51:03,612 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 40 [2024-11-08 13:51:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:03,612 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2024-11-08 13:51:03,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 13:51:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2024-11-08 13:51:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 13:51:03,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:03,614 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-08 13:51:03,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:51:03,814 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,SelfDestructingSolverStorable8 [2024-11-08 13:51:03,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:03,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1413843308, now seen corresponding path program 1 times [2024-11-08 13:51:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:03,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310422750] [2024-11-08 13:51:03,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:03,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:51:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:51:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 13:51:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:51:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 13:51:04,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:04,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310422750] [2024-11-08 13:51:04,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310422750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:04,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854160140] [2024-11-08 13:51:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:04,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:04,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:04,172 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-11-08 13:51:04,173 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-11-08 13:51:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-08 13:51:04,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:04,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:04,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-08 13:51:04,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:04,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-08 13:51:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 13:51:04,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:04,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854160140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:04,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:04,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2024-11-08 13:51:04,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719120292] [2024-11-08 13:51:04,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:04,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 13:51:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:04,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 13:51:04,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-08 13:51:04,936 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 13:51:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:06,030 INFO L93 Difference]: Finished difference Result 182 states and 232 transitions. [2024-11-08 13:51:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 13:51:06,030 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 46 [2024-11-08 13:51:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:06,032 INFO L225 Difference]: With dead ends: 182 [2024-11-08 13:51:06,032 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 13:51:06,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 13:51:06,033 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 124 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:06,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 558 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 13:51:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 13:51:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 72. [2024-11-08 13:51:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 59 states have internal predecessors, (70), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-08 13:51:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2024-11-08 13:51:06,045 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 46 [2024-11-08 13:51:06,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:06,045 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2024-11-08 13:51:06,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 13:51:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2024-11-08 13:51:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 13:51:06,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:06,048 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-08 13:51:06,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 13:51:06,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:06,249 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:06,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:06,249 INFO L85 PathProgramCache]: Analyzing trace with hash -596194858, now seen corresponding path program 1 times [2024-11-08 13:51:06,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:06,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050851878] [2024-11-08 13:51:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:06,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:51:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:51:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:07,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 13:51:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:51:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 13:51:07,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:07,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050851878] [2024-11-08 13:51:07,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050851878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:07,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046742792] [2024-11-08 13:51:07,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:07,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:07,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:07,220 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-11-08 13:51:07,221 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-11-08 13:51:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:07,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-08 13:51:07,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:07,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-08 13:51:07,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:07,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-08 13:51:07,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-08 13:51:07,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:07,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-08 13:51:08,043 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 13:51:08,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2024-11-08 13:51:08,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:51:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 13:51:32,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:33,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-08 13:51:33,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-08 13:51:33,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:33,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 218 treesize of output 237 [2024-11-08 13:51:33,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:33,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 220 treesize of output 154 [2024-11-08 13:51:33,935 INFO L349 Elim1Store]: treesize reduction 68, result has 48.5 percent of original size [2024-11-08 13:51:33,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 774 treesize of output 756 [2024-11-08 13:51:33,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 445 [2024-11-08 13:51:34,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 285 [2024-11-08 13:51:34,188 INFO L349 Elim1Store]: treesize reduction 44, result has 70.9 percent of original size [2024-11-08 13:51:34,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 862 treesize of output 882 [2024-11-08 13:51:34,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:34,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 768 treesize of output 702 [2024-11-08 13:51:34,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 321 [2024-11-08 13:51:34,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:34,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 489 treesize of output 477 [2024-11-08 13:51:37,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 320 [2024-11-08 13:51:37,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2024-11-08 13:51:38,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 900 treesize of output 882 [2024-11-08 13:51:41,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:51:41,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:41,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 306 [2024-11-08 13:51:41,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:41,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 287 treesize of output 276 [2024-11-08 13:51:41,679 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2024-11-08 13:51:41,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 122 [2024-11-08 13:51:41,698 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2024-11-08 13:51:41,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 116 [2024-11-08 13:51:41,761 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:51:41,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:41,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 361 treesize of output 359 [2024-11-08 13:51:42,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:51:42,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:51:42,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2024-11-08 13:51:42,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 100 [2024-11-08 13:51:42,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:51:42,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:51:42,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-08 13:51:42,351 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2024-11-08 13:51:42,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 145 treesize of output 1 [2024-11-08 13:51:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 13:51:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046742792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:42,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 15] total 46 [2024-11-08 13:51:42,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960445753] [2024-11-08 13:51:42,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:42,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-08 13:51:42,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:42,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-08 13:51:42,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1901, Unknown=6, NotChecked=0, Total=2070 [2024-11-08 13:51:42,607 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 46 states, 42 states have (on average 2.119047619047619) internal successors, (89), 44 states have internal predecessors, (89), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 13:51:48,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:51:56,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:52:00,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:52:04,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:52:12,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:52:16,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:52:20,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]