./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.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 3945fa4b58cef50cb4b44b435a699812e99a1f6375664d08551274c6b50bee45 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:57:09,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:57:09,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:57:09,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:57:09,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:57:09,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:57:09,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:57:09,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:57:09,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:57:09,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:57:09,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:57:09,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:57:09,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:57:09,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:57:09,119 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:57:09,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:57:09,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:57:09,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:57:09,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:57:09,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:57:09,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:57:09,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:57:09,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:57:09,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:57:09,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:57:09,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:57:09,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:57:09,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:57:09,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:57:09,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:57:09,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:57:09,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:57:09,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:57:09,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:57:09,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:57:09,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:57:09,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:57:09,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:57:09,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:57:09,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:57:09,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:57:09,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:57:09,135 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 -> 3945fa4b58cef50cb4b44b435a699812e99a1f6375664d08551274c6b50bee45 [2024-10-12 19:57:09,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:57:09,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:57:09,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:57:09,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:57:09,415 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:57:09,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c [2024-10-12 19:57:10,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:57:11,045 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:57:11,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c [2024-10-12 19:57:11,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b591f1e/6c19366a98db41aa87e66670c75adbf7/FLAG9958d7e71 [2024-10-12 19:57:11,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b591f1e/6c19366a98db41aa87e66670c75adbf7 [2024-10-12 19:57:11,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:57:11,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:57:11,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:57:11,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:57:11,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:57:11,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee176b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11, skipping insertion in model container [2024-10-12 19:57:11,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:57:11,302 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[706,719] [2024-10-12 19:57:11,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:57:11,439 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:57:11,448 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[706,719] [2024-10-12 19:57:11,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:57:11,547 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:57:11,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11 WrapperNode [2024-10-12 19:57:11,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:57:11,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:57:11,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:57:11,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:57:11,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,610 INFO L138 Inliner]: procedures = 46, calls = 57, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 682 [2024-10-12 19:57:11,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:57:11,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:57:11,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:57:11,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:57:11,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,665 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:57:11,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:57:11,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:57:11,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:57:11,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:57:11,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (1/1) ... [2024-10-12 19:57:11,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:57:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:57:11,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:57:11,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:57:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:57:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 19:57:11,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 19:57:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 19:57:11,800 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 19:57:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 19:57:11,801 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 19:57:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 19:57:11,801 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 19:57:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 19:57:11,801 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 19:57:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:57:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 19:57:11,802 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 19:57:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:57:11,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:57:11,926 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:57:11,928 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:57:12,634 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-10-12 19:57:12,636 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:57:12,695 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:57:12,695 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-12 19:57:12,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:57:12 BoogieIcfgContainer [2024-10-12 19:57:12,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:57:12,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:57:12,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:57:12,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:57:12,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:57:11" (1/3) ... [2024-10-12 19:57:12,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1415da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:57:12, skipping insertion in model container [2024-10-12 19:57:12,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:11" (2/3) ... [2024-10-12 19:57:12,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1415da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:57:12, skipping insertion in model container [2024-10-12 19:57:12,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:57:12" (3/3) ... [2024-10-12 19:57:12,703 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.09.cil.c [2024-10-12 19:57:12,718 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:57:12,719 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:57:12,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:57:12,795 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;@3a77fb7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:57:12,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:57:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 244 states have (on average 1.7295081967213115) internal successors, (422), 246 states have internal predecessors, (422), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 19:57:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:12,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:12,821 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] [2024-10-12 19:57:12,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:12,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1125709268, now seen corresponding path program 1 times [2024-10-12 19:57:12,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384843753] [2024-10-12 19:57:12,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:13,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384843753] [2024-10-12 19:57:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384843753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:13,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:13,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:57:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377578216] [2024-10-12 19:57:13,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:13,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:57:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:13,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:57:13,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:57:13,568 INFO L87 Difference]: Start difference. First operand has 274 states, 244 states have (on average 1.7295081967213115) internal successors, (422), 246 states have internal predecessors, (422), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 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-10-12 19:57:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:15,079 INFO L93 Difference]: Finished difference Result 642 states and 1100 transitions. [2024-10-12 19:57:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:57:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:15,101 INFO L225 Difference]: With dead ends: 642 [2024-10-12 19:57:15,102 INFO L226 Difference]: Without dead ends: 370 [2024-10-12 19:57:15,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-10-12 19:57:15,116 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 751 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:15,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 488 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:57:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-12 19:57:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 272. [2024-10-12 19:57:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 243 states have (on average 1.6131687242798354) internal successors, (392), 244 states have internal predecessors, (392), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 19:57:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 436 transitions. [2024-10-12 19:57:15,222 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 436 transitions. Word has length 136 [2024-10-12 19:57:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:15,223 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 436 transitions. [2024-10-12 19:57:15,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 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-10-12 19:57:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 436 transitions. [2024-10-12 19:57:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:15,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:15,230 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] [2024-10-12 19:57:15,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:57:15,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:15,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:15,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1670581842, now seen corresponding path program 1 times [2024-10-12 19:57:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:15,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166512257] [2024-10-12 19:57:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:15,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166512257] [2024-10-12 19:57:15,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166512257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:15,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:15,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:57:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346738675] [2024-10-12 19:57:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:15,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:57:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:15,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:57:15,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:57:15,516 INFO L87 Difference]: Start difference. First operand 272 states and 436 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 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-10-12 19:57:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:16,849 INFO L93 Difference]: Finished difference Result 630 states and 1025 transitions. [2024-10-12 19:57:16,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:57:16,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:16,853 INFO L225 Difference]: With dead ends: 630 [2024-10-12 19:57:16,853 INFO L226 Difference]: Without dead ends: 370 [2024-10-12 19:57:16,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-10-12 19:57:16,856 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 740 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:16,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 483 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:57:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-12 19:57:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 272. [2024-10-12 19:57:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 243 states have (on average 1.6090534979423867) internal successors, (391), 244 states have internal predecessors, (391), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 19:57:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 435 transitions. [2024-10-12 19:57:16,909 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 435 transitions. Word has length 136 [2024-10-12 19:57:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:16,909 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 435 transitions. [2024-10-12 19:57:16,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 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-10-12 19:57:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 435 transitions. [2024-10-12 19:57:16,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:16,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:16,912 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] [2024-10-12 19:57:16,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:57:16,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:16,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:16,913 INFO L85 PathProgramCache]: Analyzing trace with hash 808748240, now seen corresponding path program 1 times [2024-10-12 19:57:16,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:16,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020173416] [2024-10-12 19:57:16,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:16,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:17,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020173416] [2024-10-12 19:57:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020173416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:17,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:17,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928245968] [2024-10-12 19:57:17,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:17,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:17,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:17,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:17,213 INFO L87 Difference]: Start difference. First operand 272 states and 435 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 4 states have internal predecessors, (126), 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-10-12 19:57:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:19,446 INFO L93 Difference]: Finished difference Result 994 states and 1639 transitions. [2024-10-12 19:57:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:57:19,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 4 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:19,451 INFO L225 Difference]: With dead ends: 994 [2024-10-12 19:57:19,451 INFO L226 Difference]: Without dead ends: 737 [2024-10-12 19:57:19,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:19,454 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 1122 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:19,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 927 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 19:57:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-12 19:57:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 542. [2024-10-12 19:57:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 489 states have (on average 1.6175869120654396) internal successors, (791), 491 states have internal predecessors, (791), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-12 19:57:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 872 transitions. [2024-10-12 19:57:19,533 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 872 transitions. Word has length 136 [2024-10-12 19:57:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:19,534 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 872 transitions. [2024-10-12 19:57:19,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 4 states have internal predecessors, (126), 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-10-12 19:57:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 872 transitions. [2024-10-12 19:57:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:19,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:19,539 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] [2024-10-12 19:57:19,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:57:19,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:19,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2127751855, now seen corresponding path program 1 times [2024-10-12 19:57:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563473593] [2024-10-12 19:57:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:19,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:19,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:19,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:19,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:19,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:19,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:19,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563473593] [2024-10-12 19:57:19,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563473593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:19,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:19,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317635142] [2024-10-12 19:57:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:19,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:19,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:19,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:19,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:19,834 INFO L87 Difference]: Start difference. First operand 542 states and 872 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:23,165 INFO L93 Difference]: Finished difference Result 1762 states and 2880 transitions. [2024-10-12 19:57:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:23,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:23,177 INFO L225 Difference]: With dead ends: 1762 [2024-10-12 19:57:23,177 INFO L226 Difference]: Without dead ends: 1235 [2024-10-12 19:57:23,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:23,180 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 1227 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 3540 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 3595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:23,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 1563 Invalid, 3595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3540 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 19:57:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2024-10-12 19:57:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 792. [2024-10-12 19:57:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 715 states have (on average 1.6097902097902097) internal successors, (1151), 718 states have internal predecessors, (1151), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-12 19:57:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1268 transitions. [2024-10-12 19:57:23,274 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1268 transitions. Word has length 136 [2024-10-12 19:57:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:23,274 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1268 transitions. [2024-10-12 19:57:23,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1268 transitions. [2024-10-12 19:57:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:23,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:23,277 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] [2024-10-12 19:57:23,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:57:23,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:23,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 285276141, now seen corresponding path program 1 times [2024-10-12 19:57:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:23,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138811389] [2024-10-12 19:57:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138811389] [2024-10-12 19:57:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138811389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:23,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:23,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463991473] [2024-10-12 19:57:23,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:23,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:23,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:23,553 INFO L87 Difference]: Start difference. First operand 792 states and 1268 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:26,441 INFO L93 Difference]: Finished difference Result 2716 states and 4428 transitions. [2024-10-12 19:57:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:26,452 INFO L225 Difference]: With dead ends: 2716 [2024-10-12 19:57:26,452 INFO L226 Difference]: Without dead ends: 1939 [2024-10-12 19:57:26,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:26,455 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1225 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 3536 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 3593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:26,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 1561 Invalid, 3593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3536 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:57:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2024-10-12 19:57:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1293. [2024-10-12 19:57:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1168 states have (on average 1.6027397260273972) internal successors, (1872), 1173 states have internal predecessors, (1872), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 19:57:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 2065 transitions. [2024-10-12 19:57:26,542 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 2065 transitions. Word has length 136 [2024-10-12 19:57:26,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:26,543 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 2065 transitions. [2024-10-12 19:57:26,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 2065 transitions. [2024-10-12 19:57:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:26,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:26,546 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] [2024-10-12 19:57:26,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:57:26,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:26,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1436726545, now seen corresponding path program 1 times [2024-10-12 19:57:26,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:26,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698340722] [2024-10-12 19:57:26,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:26,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:26,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:26,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:26,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698340722] [2024-10-12 19:57:26,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698340722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:26,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:26,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:26,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57352124] [2024-10-12 19:57:26,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:26,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:26,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:26,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:26,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:26,760 INFO L87 Difference]: Start difference. First operand 1293 states and 2065 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:28,260 INFO L93 Difference]: Finished difference Result 3089 states and 5025 transitions. [2024-10-12 19:57:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:28,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:28,271 INFO L225 Difference]: With dead ends: 3089 [2024-10-12 19:57:28,272 INFO L226 Difference]: Without dead ends: 1811 [2024-10-12 19:57:28,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:28,276 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 824 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:28,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 789 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:57:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-10-12 19:57:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1293. [2024-10-12 19:57:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1168 states have (on average 1.5984589041095891) internal successors, (1867), 1173 states have internal predecessors, (1867), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 19:57:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 2060 transitions. [2024-10-12 19:57:28,375 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 2060 transitions. Word has length 136 [2024-10-12 19:57:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:28,375 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 2060 transitions. [2024-10-12 19:57:28,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 2060 transitions. [2024-10-12 19:57:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:28,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:28,378 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] [2024-10-12 19:57:28,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:57:28,378 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1769369683, now seen corresponding path program 1 times [2024-10-12 19:57:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110041954] [2024-10-12 19:57:28,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:28,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:28,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110041954] [2024-10-12 19:57:28,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110041954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:28,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:28,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:28,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996299424] [2024-10-12 19:57:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:28,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:28,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:28,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:28,591 INFO L87 Difference]: Start difference. First operand 1293 states and 2060 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:29,760 INFO L93 Difference]: Finished difference Result 3083 states and 4999 transitions. [2024-10-12 19:57:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:29,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:29,769 INFO L225 Difference]: With dead ends: 3083 [2024-10-12 19:57:29,770 INFO L226 Difference]: Without dead ends: 1805 [2024-10-12 19:57:29,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:29,774 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 827 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:29,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 789 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:57:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2024-10-12 19:57:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1293. [2024-10-12 19:57:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1168 states have (on average 1.5941780821917808) internal successors, (1862), 1173 states have internal predecessors, (1862), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 19:57:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 2055 transitions. [2024-10-12 19:57:29,881 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 2055 transitions. Word has length 136 [2024-10-12 19:57:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:29,881 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 2055 transitions. [2024-10-12 19:57:29,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 2055 transitions. [2024-10-12 19:57:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:29,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:29,884 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] [2024-10-12 19:57:29,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:57:29,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:29,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:29,885 INFO L85 PathProgramCache]: Analyzing trace with hash 159562543, now seen corresponding path program 1 times [2024-10-12 19:57:29,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:29,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126814989] [2024-10-12 19:57:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:29,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:30,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126814989] [2024-10-12 19:57:30,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126814989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:30,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:30,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182316253] [2024-10-12 19:57:30,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:30,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:30,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:30,111 INFO L87 Difference]: Start difference. First operand 1293 states and 2055 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:32,913 INFO L93 Difference]: Finished difference Result 4528 states and 7305 transitions. [2024-10-12 19:57:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:32,929 INFO L225 Difference]: With dead ends: 4528 [2024-10-12 19:57:32,929 INFO L226 Difference]: Without dead ends: 3250 [2024-10-12 19:57:32,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:32,934 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1211 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:32,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 1561 Invalid, 3512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 19:57:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2024-10-12 19:57:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2309. [2024-10-12 19:57:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2088 states have (on average 1.5881226053639848) internal successors, (3316), 2097 states have internal predecessors, (3316), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-12 19:57:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3667 transitions. [2024-10-12 19:57:33,109 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3667 transitions. Word has length 136 [2024-10-12 19:57:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:33,110 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 3667 transitions. [2024-10-12 19:57:33,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3667 transitions. [2024-10-12 19:57:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:33,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:33,114 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] [2024-10-12 19:57:33,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:57:33,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:33,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:33,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1886707505, now seen corresponding path program 1 times [2024-10-12 19:57:33,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:33,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967633433] [2024-10-12 19:57:33,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:33,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:33,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:33,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:33,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967633433] [2024-10-12 19:57:33,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967633433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:33,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:33,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:33,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165387129] [2024-10-12 19:57:33,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:33,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:33,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:33,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:33,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:33,309 INFO L87 Difference]: Start difference. First operand 2309 states and 3667 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:34,489 INFO L93 Difference]: Finished difference Result 5437 states and 8771 transitions. [2024-10-12 19:57:34,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:34,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:34,505 INFO L225 Difference]: With dead ends: 5437 [2024-10-12 19:57:34,505 INFO L226 Difference]: Without dead ends: 3143 [2024-10-12 19:57:34,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:34,512 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 990 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:34,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 661 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:57:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2024-10-12 19:57:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 2309. [2024-10-12 19:57:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2088 states have (on average 1.5838122605363985) internal successors, (3307), 2097 states have internal predecessors, (3307), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-12 19:57:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3658 transitions. [2024-10-12 19:57:34,684 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3658 transitions. Word has length 136 [2024-10-12 19:57:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:34,684 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 3658 transitions. [2024-10-12 19:57:34,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3658 transitions. [2024-10-12 19:57:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:34,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:34,688 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] [2024-10-12 19:57:34,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:57:34,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:34,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1936903441, now seen corresponding path program 1 times [2024-10-12 19:57:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:34,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582339480] [2024-10-12 19:57:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:34,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:34,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:34,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:34,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:34,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:34,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582339480] [2024-10-12 19:57:34,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582339480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:34,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684873583] [2024-10-12 19:57:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:34,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:34,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:34,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:34,915 INFO L87 Difference]: Start difference. First operand 2309 states and 3658 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:37,930 INFO L93 Difference]: Finished difference Result 8180 states and 13131 transitions. [2024-10-12 19:57:37,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:37,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:37,958 INFO L225 Difference]: With dead ends: 8180 [2024-10-12 19:57:37,958 INFO L226 Difference]: Without dead ends: 5886 [2024-10-12 19:57:37,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:37,966 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1203 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 3417 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 3474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:37,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1561 Invalid, 3474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3417 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 19:57:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5886 states. [2024-10-12 19:57:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5886 to 4351. [2024-10-12 19:57:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4351 states, 3938 states have (on average 1.5782122905027933) internal successors, (6215), 3955 states have internal predecessors, (6215), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-12 19:57:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 6900 transitions. [2024-10-12 19:57:38,330 INFO L78 Accepts]: Start accepts. Automaton has 4351 states and 6900 transitions. Word has length 136 [2024-10-12 19:57:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:38,331 INFO L471 AbstractCegarLoop]: Abstraction has 4351 states and 6900 transitions. [2024-10-12 19:57:38,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4351 states and 6900 transitions. [2024-10-12 19:57:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:38,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:38,339 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] [2024-10-12 19:57:38,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:57:38,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:38,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash 710700913, now seen corresponding path program 1 times [2024-10-12 19:57:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:38,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842000303] [2024-10-12 19:57:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:38,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:38,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842000303] [2024-10-12 19:57:38,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842000303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:38,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:38,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:38,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114199600] [2024-10-12 19:57:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:38,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:38,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:38,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:38,545 INFO L87 Difference]: Start difference. First operand 4351 states and 6900 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:41,991 INFO L93 Difference]: Finished difference Result 15500 states and 24915 transitions. [2024-10-12 19:57:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:41,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:42,036 INFO L225 Difference]: With dead ends: 15500 [2024-10-12 19:57:42,038 INFO L226 Difference]: Without dead ends: 11164 [2024-10-12 19:57:42,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:42,052 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1202 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 3461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:42,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1561 Invalid, 3461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3404 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:57:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11164 states. [2024-10-12 19:57:42,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11164 to 8448. [2024-10-12 19:57:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8448 states, 7651 states have (on average 1.5748268200235263) internal successors, (12049), 7684 states have internal predecessors, (12049), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-10-12 19:57:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8448 states to 8448 states and 13456 transitions. [2024-10-12 19:57:42,672 INFO L78 Accepts]: Start accepts. Automaton has 8448 states and 13456 transitions. Word has length 136 [2024-10-12 19:57:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:42,672 INFO L471 AbstractCegarLoop]: Abstraction has 8448 states and 13456 transitions. [2024-10-12 19:57:42,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 8448 states and 13456 transitions. [2024-10-12 19:57:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:42,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:42,687 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] [2024-10-12 19:57:42,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:57:42,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:42,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1420649809, now seen corresponding path program 1 times [2024-10-12 19:57:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:42,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136340012] [2024-10-12 19:57:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:42,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:42,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:42,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:42,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136340012] [2024-10-12 19:57:42,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136340012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:42,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:42,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983502246] [2024-10-12 19:57:42,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:42,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:42,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:42,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:42,894 INFO L87 Difference]: Start difference. First operand 8448 states and 13456 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:47,102 INFO L93 Difference]: Finished difference Result 33531 states and 54115 transitions. [2024-10-12 19:57:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:57:47,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:47,204 INFO L225 Difference]: With dead ends: 33531 [2024-10-12 19:57:47,204 INFO L226 Difference]: Without dead ends: 25098 [2024-10-12 19:57:47,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:47,242 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1275 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 3468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:47,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1536 Invalid, 3468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:57:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25098 states. [2024-10-12 19:57:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25098 to 16577. [2024-10-12 19:57:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16577 states, 15044 states have (on average 1.5753124169103963) internal successors, (23699), 15109 states have internal predecessors, (23699), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 454 states have return successors, (1871), 1141 states have call predecessors, (1871), 1078 states have call successors, (1871) [2024-10-12 19:57:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16577 states to 16577 states and 26648 transitions. [2024-10-12 19:57:48,646 INFO L78 Accepts]: Start accepts. Automaton has 16577 states and 26648 transitions. Word has length 136 [2024-10-12 19:57:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:48,646 INFO L471 AbstractCegarLoop]: Abstraction has 16577 states and 26648 transitions. [2024-10-12 19:57:48,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16577 states and 26648 transitions. [2024-10-12 19:57:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:48,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:48,670 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] [2024-10-12 19:57:48,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:57:48,671 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:48,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1835732913, now seen corresponding path program 1 times [2024-10-12 19:57:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:48,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734172200] [2024-10-12 19:57:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:48,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:48,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:48,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:48,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:48,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734172200] [2024-10-12 19:57:48,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734172200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:48,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:48,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636011472] [2024-10-12 19:57:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:48,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:48,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:48,859 INFO L87 Difference]: Start difference. First operand 16577 states and 26648 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:51,498 INFO L93 Difference]: Finished difference Result 38277 states and 62602 transitions. [2024-10-12 19:57:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:51,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:51,584 INFO L225 Difference]: With dead ends: 38277 [2024-10-12 19:57:51,585 INFO L226 Difference]: Without dead ends: 21715 [2024-10-12 19:57:51,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:51,626 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 824 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:51,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 788 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:57:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21715 states. [2024-10-12 19:57:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21715 to 16577. [2024-10-12 19:57:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16577 states, 15044 states have (on average 1.5709917575113002) internal successors, (23634), 15109 states have internal predecessors, (23634), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 454 states have return successors, (1871), 1141 states have call predecessors, (1871), 1078 states have call successors, (1871) [2024-10-12 19:57:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16577 states to 16577 states and 26583 transitions. [2024-10-12 19:57:52,807 INFO L78 Accepts]: Start accepts. Automaton has 16577 states and 26583 transitions. Word has length 136 [2024-10-12 19:57:52,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:52,808 INFO L471 AbstractCegarLoop]: Abstraction has 16577 states and 26583 transitions. [2024-10-12 19:57:52,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 16577 states and 26583 transitions. [2024-10-12 19:57:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:57:52,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:52,829 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] [2024-10-12 19:57:52,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:57:52,829 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:52,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:52,829 INFO L85 PathProgramCache]: Analyzing trace with hash -137432465, now seen corresponding path program 1 times [2024-10-12 19:57:52,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:52,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981821288] [2024-10-12 19:57:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:52,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:52,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:57:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:57:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:57:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:57:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:53,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:53,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981821288] [2024-10-12 19:57:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981821288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:53,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:53,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821067245] [2024-10-12 19:57:53,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:53,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:53,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:53,019 INFO L87 Difference]: Start difference. First operand 16577 states and 26583 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:57:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:58,763 INFO L93 Difference]: Finished difference Result 64312 states and 104401 transitions. [2024-10-12 19:57:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:57:58,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:57:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:58,939 INFO L225 Difference]: With dead ends: 64312 [2024-10-12 19:57:58,939 INFO L226 Difference]: Without dead ends: 47750 [2024-10-12 19:57:58,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:58,993 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1423 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:58,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 1536 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 19:57:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47750 states. [2024-10-12 19:58:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47750 to 32931. [2024-10-12 19:58:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32931 states, 29958 states have (on average 1.5698644769343748) internal successors, (47030), 30087 states have internal predecessors, (47030), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 902 states have return successors, (4385), 2197 states have call predecessors, (4385), 2070 states have call successors, (4385) [2024-10-12 19:58:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32931 states to 32931 states and 53485 transitions. [2024-10-12 19:58:01,709 INFO L78 Accepts]: Start accepts. Automaton has 32931 states and 53485 transitions. Word has length 136 [2024-10-12 19:58:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:01,710 INFO L471 AbstractCegarLoop]: Abstraction has 32931 states and 53485 transitions. [2024-10-12 19:58:01,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:58:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 32931 states and 53485 transitions. [2024-10-12 19:58:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:58:01,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:01,746 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] [2024-10-12 19:58:01,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:58:01,746 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:01,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2015674353, now seen corresponding path program 1 times [2024-10-12 19:58:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:01,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068679380] [2024-10-12 19:58:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:01,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:58:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:58:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:58:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:58:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:58:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:01,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068679380] [2024-10-12 19:58:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068679380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:01,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:01,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967924642] [2024-10-12 19:58:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:01,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:01,913 INFO L87 Difference]: Start difference. First operand 32931 states and 53485 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:58:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:05,727 INFO L93 Difference]: Finished difference Result 75395 states and 124793 transitions. [2024-10-12 19:58:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:58:05,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:58:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:05,999 INFO L225 Difference]: With dead ends: 75395 [2024-10-12 19:58:05,999 INFO L226 Difference]: Without dead ends: 42479 [2024-10-12 19:58:06,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:58:06,072 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 827 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:06,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 788 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:58:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42479 states. [2024-10-12 19:58:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42479 to 32931. [2024-10-12 19:58:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32931 states, 29958 states have (on average 1.565558448494559) internal successors, (46901), 30087 states have internal predecessors, (46901), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 902 states have return successors, (4385), 2197 states have call predecessors, (4385), 2070 states have call successors, (4385) [2024-10-12 19:58:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32931 states to 32931 states and 53356 transitions. [2024-10-12 19:58:08,628 INFO L78 Accepts]: Start accepts. Automaton has 32931 states and 53356 transitions. Word has length 136 [2024-10-12 19:58:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:08,628 INFO L471 AbstractCegarLoop]: Abstraction has 32931 states and 53356 transitions. [2024-10-12 19:58:08,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:58:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 32931 states and 53356 transitions. [2024-10-12 19:58:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:58:08,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:08,673 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] [2024-10-12 19:58:08,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:58:08,674 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:08,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2134115827, now seen corresponding path program 1 times [2024-10-12 19:58:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5083452] [2024-10-12 19:58:08,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:08,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:58:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:58:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:58:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:08,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:58:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:08,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:58:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:08,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:08,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5083452] [2024-10-12 19:58:08,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5083452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:08,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:08,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622603235] [2024-10-12 19:58:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:08,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:08,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:08,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:08,891 INFO L87 Difference]: Start difference. First operand 32931 states and 53356 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:58:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:16,885 INFO L93 Difference]: Finished difference Result 122580 states and 201261 transitions. [2024-10-12 19:58:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:58:16,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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 136 [2024-10-12 19:58:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:17,231 INFO L225 Difference]: With dead ends: 122580 [2024-10-12 19:58:17,231 INFO L226 Difference]: Without dead ends: 89664 [2024-10-12 19:58:17,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:58:17,346 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 1279 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:17,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1012 Invalid, 3010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 19:58:17,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89664 states. [2024-10-12 19:58:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89664 to 65894. [2024-10-12 19:58:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65894 states, 60105 states have (on average 1.565177605856418) internal successors, (94075), 60362 states have internal predecessors, (94075), 3990 states have call successors, (3990), 1542 states have call predecessors, (3990), 1798 states have return successors, (10807), 4245 states have call predecessors, (10807), 3990 states have call successors, (10807) [2024-10-12 19:58:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65894 states to 65894 states and 108872 transitions. [2024-10-12 19:58:22,636 INFO L78 Accepts]: Start accepts. Automaton has 65894 states and 108872 transitions. Word has length 136 [2024-10-12 19:58:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:22,636 INFO L471 AbstractCegarLoop]: Abstraction has 65894 states and 108872 transitions. [2024-10-12 19:58:22,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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-10-12 19:58:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 65894 states and 108872 transitions. [2024-10-12 19:58:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:58:22,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:22,718 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] [2024-10-12 19:58:22,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:58:22,718 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:22,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash -771557455, now seen corresponding path program 1 times [2024-10-12 19:58:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805828364] [2024-10-12 19:58:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:58:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:58:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:58:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:58:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:58:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:22,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805828364] [2024-10-12 19:58:22,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805828364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:22,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:22,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:22,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251329460] [2024-10-12 19:58:22,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:22,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:22,957 INFO L87 Difference]: Start difference. First operand 65894 states and 108872 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 5 states have internal predecessors, (126), 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)