./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.10.cil-2.c --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/systemc/token_ring.10.cil-2.c -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 6ba9401cadb8fecd59a1a331c94e3215cc972a92f03516bfd6c95164e3ec98a9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:29:50,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:29:50,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:29:50,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:29:50,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:29:50,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:29:50,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:29:50,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:29:50,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:29:50,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:29:50,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:29:50,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:29:50,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:29:50,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:29:50,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:29:50,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:29:50,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:29:50,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:29:50,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:29:50,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:29:50,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:29:50,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:29:50,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:29:50,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:29:50,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:29:50,902 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:29:50,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:29:50,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:29:50,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:29:50,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:29:50,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:29:50,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:29:50,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:29:50,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:29:50,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:29:50,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:29:50,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:29:50,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:29:50,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:29:50,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:29:50,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:29:50,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:29:50,907 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 -> 6ba9401cadb8fecd59a1a331c94e3215cc972a92f03516bfd6c95164e3ec98a9 [2024-11-08 15:29:51,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:29:51,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:29:51,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:29:51,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:29:51,214 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:29:51,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.10.cil-2.c [2024-11-08 15:29:52,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:29:52,839 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:29:52,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-2.c [2024-11-08 15:29:52,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bcae5e05/6299ac9b28c246dd8ab61ebf2377e69f/FLAG42b87f670 [2024-11-08 15:29:52,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bcae5e05/6299ac9b28c246dd8ab61ebf2377e69f [2024-11-08 15:29:52,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:29:52,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:29:52,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:29:52,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:29:52,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:29:52,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:29:52" (1/1) ... [2024-11-08 15:29:52,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf311d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:52, skipping insertion in model container [2024-11-08 15:29:52,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:29:52" (1/1) ... [2024-11-08 15:29:52,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:29:53,107 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/systemc/token_ring.10.cil-2.c[671,684] [2024-11-08 15:29:53,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:29:53,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:29:53,251 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/systemc/token_ring.10.cil-2.c[671,684] [2024-11-08 15:29:53,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:29:53,343 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:29:53,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53 WrapperNode [2024-11-08 15:29:53,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:29:53,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:29:53,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:29:53,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:29:53,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,412 INFO L138 Inliner]: procedures = 48, calls = 61, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 759 [2024-11-08 15:29:53,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:29:53,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:29:53,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:29:53,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:29:53,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,444 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:29:53,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:29:53,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:29:53,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:29:53,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:29:53,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (1/1) ... [2024-11-08 15:29:53,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:29:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:29:53,520 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 15:29:53,522 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 15:29:53,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:29:53,562 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-08 15:29:53,563 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-08 15:29:53,563 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-08 15:29:53,563 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-08 15:29:53,563 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-08 15:29:53,563 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-08 15:29:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-08 15:29:53,564 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-08 15:29:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-08 15:29:53,564 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-08 15:29:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:29:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-08 15:29:53,564 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-08 15:29:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:29:53,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:29:53,739 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:29:53,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:29:54,548 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-11-08 15:29:54,549 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:29:54,575 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:29:54,578 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-08 15:29:54,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:29:54 BoogieIcfgContainer [2024-11-08 15:29:54,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:29:54,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:29:54,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:29:54,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:29:54,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:29:52" (1/3) ... [2024-11-08 15:29:54,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cee3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:29:54, skipping insertion in model container [2024-11-08 15:29:54,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:53" (2/3) ... [2024-11-08 15:29:54,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cee3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:29:54, skipping insertion in model container [2024-11-08 15:29:54,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:29:54" (3/3) ... [2024-11-08 15:29:54,589 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.10.cil-2.c [2024-11-08 15:29:54,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:29:54,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:29:54,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:29:54,699 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;@7e5b0796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:29:54,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:29:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 343 states, 311 states have (on average 1.6334405144694535) internal successors, (508), 313 states have internal predecessors, (508), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 15:29:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:29:54,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:54,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:54,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:54,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1494795949, now seen corresponding path program 1 times [2024-11-08 15:29:54,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:54,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990516699] [2024-11-08 15:29:54,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:54,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:55,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:55,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:29:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:55,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:29:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:29:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:55,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:29:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:55,449 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 15:29:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:55,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990516699] [2024-11-08 15:29:55,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990516699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:29:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736843495] [2024-11-08 15:29:55,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:55,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:29:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:55,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:29:55,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:29:55,488 INFO L87 Difference]: Start difference. First operand has 343 states, 311 states have (on average 1.6334405144694535) internal successors, (508), 313 states have internal predecessors, (508), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:57,330 INFO L93 Difference]: Finished difference Result 799 states and 1310 transitions. [2024-11-08 15:29:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:29:57,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:29:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:57,345 INFO L225 Difference]: With dead ends: 799 [2024-11-08 15:29:57,345 INFO L226 Difference]: Without dead ends: 458 [2024-11-08 15:29:57,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:29:57,353 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 899 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:57,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 681 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 15:29:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-08 15:29:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 338. [2024-11-08 15:29:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 307 states have (on average 1.5472312703583062) internal successors, (475), 308 states have internal predecessors, (475), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 15:29:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 523 transitions. [2024-11-08 15:29:57,454 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 523 transitions. Word has length 155 [2024-11-08 15:29:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:57,455 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 523 transitions. [2024-11-08 15:29:57,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 523 transitions. [2024-11-08 15:29:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:29:57,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:57,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:57,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:29:57,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1759443439, now seen corresponding path program 1 times [2024-11-08 15:29:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:57,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289957542] [2024-11-08 15:29:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:57,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:29:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:57,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:29:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:29:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:57,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:29:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:57,746 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 15:29:57,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:57,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289957542] [2024-11-08 15:29:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289957542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:57,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:57,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:29:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040108231] [2024-11-08 15:29:57,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:57,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:29:57,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:57,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:29:57,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:29:57,751 INFO L87 Difference]: Start difference. First operand 338 states and 523 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:59,154 INFO L93 Difference]: Finished difference Result 782 states and 1230 transitions. [2024-11-08 15:29:59,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:29:59,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:29:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:59,159 INFO L225 Difference]: With dead ends: 782 [2024-11-08 15:29:59,159 INFO L226 Difference]: Without dead ends: 458 [2024-11-08 15:29:59,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:29:59,162 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 886 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:59,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 667 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 15:29:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-08 15:29:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 338. [2024-11-08 15:29:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 307 states have (on average 1.5439739413680782) internal successors, (474), 308 states have internal predecessors, (474), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 15:29:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 522 transitions. [2024-11-08 15:29:59,202 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 522 transitions. Word has length 155 [2024-11-08 15:29:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:59,203 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 522 transitions. [2024-11-08 15:29:59,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 522 transitions. [2024-11-08 15:29:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:29:59,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:59,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:59,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:29:59,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:59,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1348833073, now seen corresponding path program 1 times [2024-11-08 15:29:59,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319735171] [2024-11-08 15:29:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:59,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:29:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:29:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:29:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:59,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:29:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:59,587 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 15:29:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319735171] [2024-11-08 15:29:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319735171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:59,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:59,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:29:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423606564] [2024-11-08 15:29:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:59,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:29:59,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:29:59,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:29:59,591 INFO L87 Difference]: Start difference. First operand 338 states and 522 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:30:02,030 INFO L93 Difference]: Finished difference Result 1232 states and 1951 transitions. [2024-11-08 15:30:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:30:02,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:30:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:30:02,035 INFO L225 Difference]: With dead ends: 1232 [2024-11-08 15:30:02,036 INFO L226 Difference]: Without dead ends: 912 [2024-11-08 15:30:02,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:30:02,038 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1341 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:30:02,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 1143 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 15:30:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-11-08 15:30:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 673. [2024-11-08 15:30:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 616 states have (on average 1.5568181818181819) internal successors, (959), 618 states have internal predecessors, (959), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2024-11-08 15:30:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1048 transitions. [2024-11-08 15:30:02,089 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1048 transitions. Word has length 155 [2024-11-08 15:30:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:30:02,090 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1048 transitions. [2024-11-08 15:30:02,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1048 transitions. [2024-11-08 15:30:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:30:02,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:30:02,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:02,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:30:02,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:30:02,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:30:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1123533899, now seen corresponding path program 1 times [2024-11-08 15:30:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:30:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365992956] [2024-11-08 15:30:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:30:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:30:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:30:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:02,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:30:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:30:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:02,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:30:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:02,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:30:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:02,405 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 15:30:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:30:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365992956] [2024-11-08 15:30:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365992956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:30:02,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:30:02,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:30:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597316626] [2024-11-08 15:30:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:30:02,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:30:02,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:30:02,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:30:02,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:30:02,410 INFO L87 Difference]: Start difference. First operand 673 states and 1048 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:30:05,491 INFO L93 Difference]: Finished difference Result 2037 states and 3229 transitions. [2024-11-08 15:30:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:30:05,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:30:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:30:05,501 INFO L225 Difference]: With dead ends: 2037 [2024-11-08 15:30:05,501 INFO L226 Difference]: Without dead ends: 1382 [2024-11-08 15:30:05,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:30:05,505 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 1368 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 3056 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:30:05,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 2212 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3056 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 15:30:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-08 15:30:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 985. [2024-11-08 15:30:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 902 states have (on average 1.5498891352549888) internal successors, (1398), 905 states have internal predecessors, (1398), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (67), 63 states have call predecessors, (67), 62 states have call successors, (67) [2024-11-08 15:30:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1527 transitions. [2024-11-08 15:30:05,585 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1527 transitions. Word has length 155 [2024-11-08 15:30:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:30:05,585 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1527 transitions. [2024-11-08 15:30:05,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1527 transitions. [2024-11-08 15:30:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:30:05,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:30:05,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:05,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:30:05,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:30:05,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:30:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1553992947, now seen corresponding path program 1 times [2024-11-08 15:30:05,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:30:05,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661217367] [2024-11-08 15:30:05,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:30:05,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:30:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:05,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:30:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:30:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:30:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:30:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:30:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:05,866 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 15:30:05,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:30:05,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661217367] [2024-11-08 15:30:05,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661217367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:30:05,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:30:05,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:30:05,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618587980] [2024-11-08 15:30:05,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:30:05,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:30:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:30:05,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:30:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:30:05,868 INFO L87 Difference]: Start difference. First operand 985 states and 1527 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:08,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:30:08,563 INFO L93 Difference]: Finished difference Result 3224 states and 5098 transitions. [2024-11-08 15:30:08,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:30:08,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:30:08,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:30:08,577 INFO L225 Difference]: With dead ends: 3224 [2024-11-08 15:30:08,577 INFO L226 Difference]: Without dead ends: 2257 [2024-11-08 15:30:08,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:30:08,583 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1470 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:30:08,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1415 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 15:30:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-11-08 15:30:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 1610. [2024-11-08 15:30:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1475 states have (on average 1.5437288135593221) internal successors, (2277), 1480 states have internal predecessors, (2277), 100 states have call successors, (100), 30 states have call predecessors, (100), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-11-08 15:30:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2490 transitions. [2024-11-08 15:30:08,708 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2490 transitions. Word has length 155 [2024-11-08 15:30:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:30:08,708 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2490 transitions. [2024-11-08 15:30:08,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2490 transitions. [2024-11-08 15:30:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:30:08,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:30:08,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:08,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:30:08,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:30:08,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:30:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1917459445, now seen corresponding path program 1 times [2024-11-08 15:30:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:30:08,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281436519] [2024-11-08 15:30:08,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:30:08,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:30:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:08,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:30:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:08,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:30:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:30:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:08,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:30:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:08,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:30:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:08,961 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 15:30:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:30:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281436519] [2024-11-08 15:30:08,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281436519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:30:08,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:30:08,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:30:08,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349434116] [2024-11-08 15:30:08,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:30:08,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:30:08,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:30:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:30:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:30:08,964 INFO L87 Difference]: Start difference. First operand 1610 states and 2490 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:30:11,890 INFO L93 Difference]: Finished difference Result 5506 states and 8669 transitions. [2024-11-08 15:30:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:30:11,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:30:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:30:11,910 INFO L225 Difference]: With dead ends: 5506 [2024-11-08 15:30:11,912 INFO L226 Difference]: Without dead ends: 3914 [2024-11-08 15:30:11,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:30:11,919 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 1366 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 3026 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:30:11,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 2210 Invalid, 3085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3026 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 15:30:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2024-11-08 15:30:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 2866. [2024-11-08 15:30:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2627 states have (on average 1.5397792158355539) internal successors, (4045), 2636 states have internal predecessors, (4045), 176 states have call successors, (176), 54 states have call predecessors, (176), 62 states have return successors, (211), 183 states have call predecessors, (211), 176 states have call successors, (211) [2024-11-08 15:30:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4432 transitions. [2024-11-08 15:30:12,119 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4432 transitions. Word has length 155 [2024-11-08 15:30:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:30:12,120 INFO L471 AbstractCegarLoop]: Abstraction has 2866 states and 4432 transitions. [2024-11-08 15:30:12,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4432 transitions. [2024-11-08 15:30:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:30:12,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:30:12,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:12,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:30:12,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:30:12,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:30:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1372586871, now seen corresponding path program 1 times [2024-11-08 15:30:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:30:12,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096229833] [2024-11-08 15:30:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:30:12,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:30:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:12,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:30:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:12,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:30:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:12,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:30:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:30:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:30:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:12,393 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 15:30:12,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:30:12,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096229833] [2024-11-08 15:30:12,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096229833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:30:12,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:30:12,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:30:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760517909] [2024-11-08 15:30:12,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:30:12,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:30:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:30:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:30:12,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:30:12,396 INFO L87 Difference]: Start difference. First operand 2866 states and 4432 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:30:15,467 INFO L93 Difference]: Finished difference Result 10080 states and 15845 transitions. [2024-11-08 15:30:15,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:30:15,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:30:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:30:15,498 INFO L225 Difference]: With dead ends: 10080 [2024-11-08 15:30:15,498 INFO L226 Difference]: Without dead ends: 7232 [2024-11-08 15:30:15,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:30:15,508 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 1365 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 3013 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 3072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:30:15,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 2210 Invalid, 3072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3013 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 15:30:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7232 states. [2024-11-08 15:30:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7232 to 5383. [2024-11-08 15:30:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5383 states, 4936 states have (on average 1.5370745542949757) internal successors, (7587), 4953 states have internal predecessors, (7587), 328 states have call successors, (328), 102 states have call predecessors, (328), 118 states have return successors, (425), 343 states have call predecessors, (425), 328 states have call successors, (425) [2024-11-08 15:30:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 8340 transitions. [2024-11-08 15:30:15,878 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 8340 transitions. Word has length 155 [2024-11-08 15:30:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:30:15,882 INFO L471 AbstractCegarLoop]: Abstraction has 5383 states and 8340 transitions. [2024-11-08 15:30:15,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 8340 transitions. [2024-11-08 15:30:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:30:15,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:30:15,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:15,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:30:15,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:30:15,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:30:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2047746997, now seen corresponding path program 1 times [2024-11-08 15:30:15,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:30:15,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331549202] [2024-11-08 15:30:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:30:15,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:30:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:15,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:30:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:30:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:16,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:30:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:16,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:30:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:30:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:16,134 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 15:30:16,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:30:16,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331549202] [2024-11-08 15:30:16,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331549202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:30:16,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:30:16,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:30:16,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241684801] [2024-11-08 15:30:16,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:30:16,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:30:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:30:16,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:30:16,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:30:16,138 INFO L87 Difference]: Start difference. First operand 5383 states and 8340 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:30:19,785 INFO L93 Difference]: Finished difference Result 19227 states and 30255 transitions. [2024-11-08 15:30:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:30:19,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:30:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:30:19,852 INFO L225 Difference]: With dead ends: 19227 [2024-11-08 15:30:19,852 INFO L226 Difference]: Without dead ends: 13862 [2024-11-08 15:30:19,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:30:19,873 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 1364 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 3000 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:30:19,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 2210 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3000 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 15:30:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13862 states. [2024-11-08 15:30:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13862 to 10432. [2024-11-08 15:30:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10432 states, 9569 states have (on average 1.5354791514264814) internal successors, (14693), 9602 states have internal predecessors, (14693), 632 states have call successors, (632), 198 states have call predecessors, (632), 230 states have return successors, (907), 663 states have call predecessors, (907), 632 states have call successors, (907) [2024-11-08 15:30:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10432 states to 10432 states and 16232 transitions. [2024-11-08 15:30:20,553 INFO L78 Accepts]: Start accepts. Automaton has 10432 states and 16232 transitions. Word has length 155 [2024-11-08 15:30:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:30:20,553 INFO L471 AbstractCegarLoop]: Abstraction has 10432 states and 16232 transitions. [2024-11-08 15:30:20,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 10432 states and 16232 transitions. [2024-11-08 15:30:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:30:20,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:30:20,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:20,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:30:20,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:30:20,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:30:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1099695031, now seen corresponding path program 1 times [2024-11-08 15:30:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:30:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686317636] [2024-11-08 15:30:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:30:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:30:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:20,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:30:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:30:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:20,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:30:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:30:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:20,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:30:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:20,785 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 15:30:20,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:30:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686317636] [2024-11-08 15:30:20,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686317636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:30:20,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:30:20,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:30:20,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992878117] [2024-11-08 15:30:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:30:20,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:30:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:30:20,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:30:20,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:30:20,789 INFO L87 Difference]: Start difference. First operand 10432 states and 16232 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:30:24,773 INFO L93 Difference]: Finished difference Result 37522 states and 59269 transitions. [2024-11-08 15:30:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:30:24,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:30:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:30:24,893 INFO L225 Difference]: With dead ends: 37522 [2024-11-08 15:30:24,893 INFO L226 Difference]: Without dead ends: 27108 [2024-11-08 15:30:24,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:30:24,939 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 1363 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 2987 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:30:24,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 2210 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2987 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 15:30:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27108 states. [2024-11-08 15:30:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27108 to 20561. [2024-11-08 15:30:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20561 states, 18866 states have (on average 1.5345595250715574) internal successors, (28951), 18931 states have internal predecessors, (28951), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 454 states have return successors, (2033), 1303 states have call predecessors, (2033), 1240 states have call successors, (2033) [2024-11-08 15:30:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20561 states to 20561 states and 32224 transitions. [2024-11-08 15:30:26,364 INFO L78 Accepts]: Start accepts. Automaton has 20561 states and 32224 transitions. Word has length 155 [2024-11-08 15:30:26,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:30:26,364 INFO L471 AbstractCegarLoop]: Abstraction has 20561 states and 32224 transitions. [2024-11-08 15:30:26,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:26,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20561 states and 32224 transitions. [2024-11-08 15:30:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:30:26,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:30:26,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:26,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:30:26,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:30:26,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:30:26,384 INFO L85 PathProgramCache]: Analyzing trace with hash 514923381, now seen corresponding path program 1 times [2024-11-08 15:30:26,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:30:26,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709171263] [2024-11-08 15:30:26,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:30:26,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:30:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:30:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:26,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:30:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:30:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:30:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:26,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:30:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:26,663 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 15:30:26,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:30:26,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709171263] [2024-11-08 15:30:26,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709171263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:30:26,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:30:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:30:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238326326] [2024-11-08 15:30:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:30:26,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:30:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:30:26,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:30:26,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:30:26,667 INFO L87 Difference]: Start difference. First operand 20561 states and 32224 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:30:31,453 INFO L93 Difference]: Finished difference Result 74113 states and 117899 transitions. [2024-11-08 15:30:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:30:31,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:30:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:30:31,678 INFO L225 Difference]: With dead ends: 74113 [2024-11-08 15:30:31,679 INFO L226 Difference]: Without dead ends: 53570 [2024-11-08 15:30:31,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:30:31,741 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 1362 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:30:31,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 2210 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 15:30:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53570 states. [2024-11-08 15:30:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53570 to 40882. [2024-11-08 15:30:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40882 states, 37523 states have (on average 1.5340191349305758) internal successors, (57561), 37652 states have internal predecessors, (57561), 2456 states have call successors, (2456), 774 states have call predecessors, (2456), 902 states have return successors, (4771), 2583 states have call predecessors, (4771), 2456 states have call successors, (4771) [2024-11-08 15:30:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40882 states to 40882 states and 64788 transitions. [2024-11-08 15:30:34,657 INFO L78 Accepts]: Start accepts. Automaton has 40882 states and 64788 transitions. Word has length 155 [2024-11-08 15:30:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:30:34,658 INFO L471 AbstractCegarLoop]: Abstraction has 40882 states and 64788 transitions. [2024-11-08 15:30:34,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 40882 states and 64788 transitions. [2024-11-08 15:30:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:30:34,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:30:34,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:34,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:30:34,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:30:34,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:30:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 80417783, now seen corresponding path program 1 times [2024-11-08 15:30:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:30:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974204482] [2024-11-08 15:30:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:30:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:30:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:34,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:30:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:34,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:30:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:34,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:30:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:30:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:34,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:30:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:34,879 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 15:30:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:30:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974204482] [2024-11-08 15:30:34,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974204482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:30:34,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:30:34,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:30:34,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750116063] [2024-11-08 15:30:34,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:30:34,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:30:34,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:30:34,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:30:34,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:30:34,881 INFO L87 Difference]: Start difference. First operand 40882 states and 64788 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:30:41,989 INFO L93 Difference]: Finished difference Result 147296 states and 237009 transitions. [2024-11-08 15:30:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:30:41,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 155 [2024-11-08 15:30:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:30:42,505 INFO L225 Difference]: With dead ends: 147296 [2024-11-08 15:30:42,506 INFO L226 Difference]: Without dead ends: 106432 [2024-11-08 15:30:42,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:30:42,887 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 1361 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 2961 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:30:42,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 2210 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2961 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 15:30:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106432 states. [2024-11-08 15:30:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106432 to 81651. [2024-11-08 15:30:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81651 states, 74964 states have (on average 1.5336828344271918) internal successors, (114971), 75221 states have internal predecessors, (114971), 4888 states have call successors, (4888), 1542 states have call predecessors, (4888), 1798 states have return successors, (11705), 5143 states have call predecessors, (11705), 4888 states have call successors, (11705) [2024-11-08 15:30:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81651 states to 81651 states and 131564 transitions. [2024-11-08 15:30:48,341 INFO L78 Accepts]: Start accepts. Automaton has 81651 states and 131564 transitions. Word has length 155 [2024-11-08 15:30:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:30:48,341 INFO L471 AbstractCegarLoop]: Abstraction has 81651 states and 131564 transitions. [2024-11-08 15:30:48,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:30:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 81651 states and 131564 transitions. [2024-11-08 15:30:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 15:30:48,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:30:48,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:48,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:30:48,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:30:48,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:30:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash -349240523, now seen corresponding path program 1 times [2024-11-08 15:30:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:30:48,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168526377] [2024-11-08 15:30:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:30:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:30:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:30:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:48,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:30:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:48,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:30:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:30:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:48,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:30:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:30:48,597 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 15:30:48,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:30:48,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168526377] [2024-11-08 15:30:48,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168526377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:30:48,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:30:48,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:30:48,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589626963] [2024-11-08 15:30:48,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:30:48,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:30:48,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:30:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:30:48,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:30:48,600 INFO L87 Difference]: Start difference. First operand 81651 states and 131564 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 5 states have internal predecessors, (145), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)