./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.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 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:12:19,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:12:19,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:12:19,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:12:19,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:12:19,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:12:19,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:12:19,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:12:19,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:12:19,215 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:12:19,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:12:19,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:12:19,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:12:19,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:12:19,216 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:12:19,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:12:19,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:12:19,219 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:12:19,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:12:19,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:12:19,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:12:19,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:12:19,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:12:19,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:12:19,222 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:12:19,223 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:12:19,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:12:19,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:12:19,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:12:19,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:12:19,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:12:19,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:12:19,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:12:19,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:12:19,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:12:19,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:12:19,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:12:19,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:12:19,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:12:19,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:12:19,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:12:19,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:12:19,227 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 -> 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 [2024-11-11 21:12:19,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:12:19,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:12:19,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:12:19,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:12:19,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:12:19,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-11 21:12:20,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:12:20,813 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:12:20,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-11 21:12:20,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca443bc8/703a2ebcb13741b4b6c61012cee102ef/FLAGaa9fe1055 [2024-11-11 21:12:21,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca443bc8/703a2ebcb13741b4b6c61012cee102ef [2024-11-11 21:12:21,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:12:21,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:12:21,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:12:21,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:12:21,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:12:21,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28dcb576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21, skipping insertion in model container [2024-11-11 21:12:21,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:12:21,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c[11921,11934] [2024-11-11 21:12:21,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:12:21,465 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:12:21,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c[11921,11934] [2024-11-11 21:12:21,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:12:21,550 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:12:21,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21 WrapperNode [2024-11-11 21:12:21,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:12:21,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:12:21,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:12:21,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:12:21,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,609 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 416 [2024-11-11 21:12:21,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:12:21,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:12:21,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:12:21,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:12:21,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,659 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:12:21,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:12:21,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:12:21,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:12:21,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:12:21,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (1/1) ... [2024-11-11 21:12:21,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:12:21,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:21,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:12:21,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:12:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:12:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-11 21:12:21,764 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-11 21:12:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-11 21:12:21,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-11 21:12:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-11 21:12:21,765 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-11 21:12:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-11 21:12:21,766 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-11 21:12:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-11 21:12:21,766 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-11 21:12:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 21:12:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 21:12:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:12:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:12:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:12:21,866 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:12:21,870 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:12:22,380 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-11-11 21:12:22,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:12:22,404 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:12:22,405 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 21:12:22,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:12:22 BoogieIcfgContainer [2024-11-11 21:12:22,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:12:22,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:12:22,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:12:22,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:12:22,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:12:21" (1/3) ... [2024-11-11 21:12:22,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e5dfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:12:22, skipping insertion in model container [2024-11-11 21:12:22,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:21" (2/3) ... [2024-11-11 21:12:22,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e5dfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:12:22, skipping insertion in model container [2024-11-11 21:12:22,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:12:22" (3/3) ... [2024-11-11 21:12:22,415 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-11 21:12:22,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:12:22,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:12:22,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:12:22,499 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;@28e04334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:12:22,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:12:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 132 states have (on average 1.5833333333333333) internal successors, (209), 137 states have internal predecessors, (209), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-11 21:12:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 21:12:22,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:22,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:22,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:22,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:22,521 INFO L85 PathProgramCache]: Analyzing trace with hash 559867366, now seen corresponding path program 1 times [2024-11-11 21:12:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:22,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931844561] [2024-11-11 21:12:22,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:22,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931844561] [2024-11-11 21:12:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931844561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:22,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:22,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098440771] [2024-11-11 21:12:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:22,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:22,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:22,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:22,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:22,874 INFO L87 Difference]: Start difference. First operand has 177 states, 132 states have (on average 1.5833333333333333) internal successors, (209), 137 states have internal predecessors, (209), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:23,005 INFO L93 Difference]: Finished difference Result 353 states and 604 transitions. [2024-11-11 21:12:23,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:23,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-11 21:12:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:23,017 INFO L225 Difference]: With dead ends: 353 [2024-11-11 21:12:23,017 INFO L226 Difference]: Without dead ends: 179 [2024-11-11 21:12:23,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:23,027 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 7 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:23,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 797 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-11 21:12:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-11 21:12:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 134 states have (on average 1.5522388059701493) internal successors, (208), 138 states have internal predecessors, (208), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-11 21:12:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 282 transitions. [2024-11-11 21:12:23,071 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 282 transitions. Word has length 15 [2024-11-11 21:12:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:23,071 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 282 transitions. [2024-11-11 21:12:23,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 282 transitions. [2024-11-11 21:12:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 21:12:23,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:23,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:23,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:12:23,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:23,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1518249102, now seen corresponding path program 1 times [2024-11-11 21:12:23,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:23,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434993767] [2024-11-11 21:12:23,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:23,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:23,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434993767] [2024-11-11 21:12:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434993767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:23,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353536789] [2024-11-11 21:12:23,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:23,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:23,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:23,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:23,174 INFO L87 Difference]: Start difference. First operand 179 states and 282 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:23,230 INFO L93 Difference]: Finished difference Result 371 states and 587 transitions. [2024-11-11 21:12:23,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:23,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-11 21:12:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:23,234 INFO L225 Difference]: With dead ends: 371 [2024-11-11 21:12:23,234 INFO L226 Difference]: Without dead ends: 195 [2024-11-11 21:12:23,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:23,237 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 25 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:23,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 813 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-11 21:12:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-11 21:12:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 149 states have internal predecessors, (222), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-11 21:12:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 298 transitions. [2024-11-11 21:12:23,256 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 298 transitions. Word has length 16 [2024-11-11 21:12:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:23,257 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 298 transitions. [2024-11-11 21:12:23,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 298 transitions. [2024-11-11 21:12:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 21:12:23,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:23,258 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:23,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:12:23,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:23,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2053060758, now seen corresponding path program 1 times [2024-11-11 21:12:23,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:23,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146347542] [2024-11-11 21:12:23,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:23,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:23,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146347542] [2024-11-11 21:12:23,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146347542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:23,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:23,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167268312] [2024-11-11 21:12:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:23,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:23,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:23,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:23,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:23,370 INFO L87 Difference]: Start difference. First operand 192 states and 298 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 21:12:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:23,393 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2024-11-11 21:12:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:23,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-11 21:12:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:23,395 INFO L225 Difference]: With dead ends: 403 [2024-11-11 21:12:23,396 INFO L226 Difference]: Without dead ends: 221 [2024-11-11 21:12:23,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:23,397 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 22 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:23,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 550 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-11 21:12:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2024-11-11 21:12:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 147 states have (on average 1.5238095238095237) internal successors, (224), 151 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-11 21:12:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 300 transitions. [2024-11-11 21:12:23,417 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 300 transitions. Word has length 24 [2024-11-11 21:12:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 300 transitions. [2024-11-11 21:12:23,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 21:12:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 300 transitions. [2024-11-11 21:12:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 21:12:23,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:23,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:23,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:12:23,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:23,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:23,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1605801767, now seen corresponding path program 1 times [2024-11-11 21:12:23,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:23,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867924506] [2024-11-11 21:12:23,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:23,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:23,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867924506] [2024-11-11 21:12:23,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867924506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:23,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:23,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603552645] [2024-11-11 21:12:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:23,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:23,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:23,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:23,526 INFO L87 Difference]: Start difference. First operand 194 states and 300 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:23,564 INFO L93 Difference]: Finished difference Result 378 states and 589 transitions. [2024-11-11 21:12:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:23,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-11 21:12:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:23,567 INFO L225 Difference]: With dead ends: 378 [2024-11-11 21:12:23,567 INFO L226 Difference]: Without dead ends: 200 [2024-11-11 21:12:23,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:23,570 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:23,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-11 21:12:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2024-11-11 21:12:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 150 states have (on average 1.5133333333333334) internal successors, (227), 154 states have internal predecessors, (227), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-11 21:12:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 304 transitions. [2024-11-11 21:12:23,579 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 304 transitions. Word has length 32 [2024-11-11 21:12:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:23,579 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 304 transitions. [2024-11-11 21:12:23,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 304 transitions. [2024-11-11 21:12:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 21:12:23,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:23,581 INFO L218 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] [2024-11-11 21:12:23,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:12:23,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:23,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1129595597, now seen corresponding path program 1 times [2024-11-11 21:12:23,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:23,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753556525] [2024-11-11 21:12:23,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:12:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:23,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:23,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753556525] [2024-11-11 21:12:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753556525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:23,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:12:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103954671] [2024-11-11 21:12:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:23,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:12:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:12:23,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:23,751 INFO L87 Difference]: Start difference. First operand 198 states and 304 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 21:12:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:23,812 INFO L93 Difference]: Finished difference Result 341 states and 530 transitions. [2024-11-11 21:12:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:12:23,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-11 21:12:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:23,816 INFO L225 Difference]: With dead ends: 341 [2024-11-11 21:12:23,816 INFO L226 Difference]: Without dead ends: 194 [2024-11-11 21:12:23,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:23,817 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:23,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-11 21:12:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-11 21:12:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 147 states have (on average 1.489795918367347) internal successors, (219), 151 states have internal predecessors, (219), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-11 21:12:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 295 transitions. [2024-11-11 21:12:23,826 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 295 transitions. Word has length 35 [2024-11-11 21:12:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:23,826 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 295 transitions. [2024-11-11 21:12:23,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 21:12:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 295 transitions. [2024-11-11 21:12:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 21:12:23,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:23,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:23,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:12:23,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:23,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1343681902, now seen corresponding path program 1 times [2024-11-11 21:12:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:23,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035377854] [2024-11-11 21:12:23,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:23,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:23,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035377854] [2024-11-11 21:12:23,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035377854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557085638] [2024-11-11 21:12:23,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:23,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:23,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:23,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:23,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:12:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:12:24,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:24,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557085638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:24,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-11 21:12:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390509553] [2024-11-11 21:12:24,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:24,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:24,088 INFO L87 Difference]: Start difference. First operand 194 states and 295 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 21:12:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:24,131 INFO L93 Difference]: Finished difference Result 436 states and 677 transitions. [2024-11-11 21:12:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:24,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-11 21:12:24,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:24,135 INFO L225 Difference]: With dead ends: 436 [2024-11-11 21:12:24,135 INFO L226 Difference]: Without dead ends: 253 [2024-11-11 21:12:24,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:24,137 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 109 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:24,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 555 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-11 21:12:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247. [2024-11-11 21:12:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 190 states have (on average 1.4631578947368422) internal successors, (278), 194 states have internal predecessors, (278), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-11 21:12:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 374 transitions. [2024-11-11 21:12:24,153 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 374 transitions. Word has length 35 [2024-11-11 21:12:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:24,153 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 374 transitions. [2024-11-11 21:12:24,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 21:12:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 374 transitions. [2024-11-11 21:12:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:12:24,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:24,158 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:24,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:12:24,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 21:12:24,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:24,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:24,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1968918546, now seen corresponding path program 2 times [2024-11-11 21:12:24,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:24,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796710578] [2024-11-11 21:12:24,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:24,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-11 21:12:24,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796710578] [2024-11-11 21:12:24,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796710578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:24,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:24,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:24,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175719515] [2024-11-11 21:12:24,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:24,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:24,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:24,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:24,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:24,433 INFO L87 Difference]: Start difference. First operand 247 states and 374 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:24,483 INFO L93 Difference]: Finished difference Result 472 states and 732 transitions. [2024-11-11 21:12:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:24,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-11 21:12:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:24,485 INFO L225 Difference]: With dead ends: 472 [2024-11-11 21:12:24,485 INFO L226 Difference]: Without dead ends: 254 [2024-11-11 21:12:24,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:24,488 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 8 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:24,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 787 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-11 21:12:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-11 21:12:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 196 states have (on average 1.4591836734693877) internal successors, (286), 200 states have internal predecessors, (286), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-11 21:12:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2024-11-11 21:12:24,504 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 57 [2024-11-11 21:12:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:24,504 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2024-11-11 21:12:24,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2024-11-11 21:12:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:12:24,507 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:24,507 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:24,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:12:24,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:24,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:24,508 INFO L85 PathProgramCache]: Analyzing trace with hash -784911651, now seen corresponding path program 1 times [2024-11-11 21:12:24,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:24,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464320066] [2024-11-11 21:12:24,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:24,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 21:12:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:24,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464320066] [2024-11-11 21:12:24,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464320066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:24,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:24,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:24,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014093459] [2024-11-11 21:12:24,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:24,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:24,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:24,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:24,583 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:24,620 INFO L93 Difference]: Finished difference Result 518 states and 790 transitions. [2024-11-11 21:12:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:24,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-11 21:12:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:24,623 INFO L225 Difference]: With dead ends: 518 [2024-11-11 21:12:24,623 INFO L226 Difference]: Without dead ends: 293 [2024-11-11 21:12:24,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:24,625 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 24 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:24,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 805 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-11 21:12:24,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2024-11-11 21:12:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 228 states have (on average 1.4166666666666667) internal successors, (323), 232 states have internal predecessors, (323), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-11 21:12:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 425 transitions. [2024-11-11 21:12:24,639 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 425 transitions. Word has length 57 [2024-11-11 21:12:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:24,639 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 425 transitions. [2024-11-11 21:12:24,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 425 transitions. [2024-11-11 21:12:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 21:12:24,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:24,641 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:24,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:12:24,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:24,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1749980024, now seen corresponding path program 1 times [2024-11-11 21:12:24,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:24,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508302793] [2024-11-11 21:12:24,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:24,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 21:12:24,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508302793] [2024-11-11 21:12:24,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508302793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:24,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:24,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:24,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601728393] [2024-11-11 21:12:24,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:24,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:24,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:24,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:24,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:24,740 INFO L87 Difference]: Start difference. First operand 290 states and 425 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:24,761 INFO L93 Difference]: Finished difference Result 529 states and 789 transitions. [2024-11-11 21:12:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:24,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2024-11-11 21:12:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:24,763 INFO L225 Difference]: With dead ends: 529 [2024-11-11 21:12:24,763 INFO L226 Difference]: Without dead ends: 292 [2024-11-11 21:12:24,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:24,764 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 0 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:24,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1073 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-11 21:12:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2024-11-11 21:12:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 232 states have internal predecessors, (320), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-11 21:12:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 422 transitions. [2024-11-11 21:12:24,774 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 422 transitions. Word has length 75 [2024-11-11 21:12:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:24,774 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 422 transitions. [2024-11-11 21:12:24,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 422 transitions. [2024-11-11 21:12:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 21:12:24,775 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:24,775 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:24,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:12:24,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:24,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:24,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1059319133, now seen corresponding path program 1 times [2024-11-11 21:12:24,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:24,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347644970] [2024-11-11 21:12:24,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:24,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-11 21:12:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347644970] [2024-11-11 21:12:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347644970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:24,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:24,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920364855] [2024-11-11 21:12:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:24,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:24,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:24,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:24,877 INFO L87 Difference]: Start difference. First operand 290 states and 422 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:24,920 INFO L93 Difference]: Finished difference Result 566 states and 845 transitions. [2024-11-11 21:12:24,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:24,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-11 21:12:24,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:24,923 INFO L225 Difference]: With dead ends: 566 [2024-11-11 21:12:24,923 INFO L226 Difference]: Without dead ends: 334 [2024-11-11 21:12:24,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:24,925 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 25 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:24,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 805 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-11 21:12:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2024-11-11 21:12:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 265 states have (on average 1.3660377358490565) internal successors, (362), 269 states have internal predecessors, (362), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-11 21:12:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 470 transitions. [2024-11-11 21:12:24,938 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 470 transitions. Word has length 104 [2024-11-11 21:12:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:24,939 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 470 transitions. [2024-11-11 21:12:24,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 470 transitions. [2024-11-11 21:12:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 21:12:24,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:24,939 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:24,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:12:24,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:24,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 683313439, now seen corresponding path program 1 times [2024-11-11 21:12:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:24,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439146301] [2024-11-11 21:12:24,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:24,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-11 21:12:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:25,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439146301] [2024-11-11 21:12:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439146301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835667621] [2024-11-11 21:12:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:25,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:25,025 INFO L87 Difference]: Start difference. First operand 331 states and 470 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:25,067 INFO L93 Difference]: Finished difference Result 592 states and 865 transitions. [2024-11-11 21:12:25,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:25,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2024-11-11 21:12:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:25,069 INFO L225 Difference]: With dead ends: 592 [2024-11-11 21:12:25,069 INFO L226 Difference]: Without dead ends: 325 [2024-11-11 21:12:25,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,071 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 9 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:25,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 770 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-11 21:12:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2024-11-11 21:12:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 264 states have internal predecessors, (350), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-11 21:12:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 456 transitions. [2024-11-11 21:12:25,081 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 456 transitions. Word has length 105 [2024-11-11 21:12:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:25,082 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 456 transitions. [2024-11-11 21:12:25,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 456 transitions. [2024-11-11 21:12:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 21:12:25,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:25,083 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:25,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:12:25,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:25,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1739189569, now seen corresponding path program 1 times [2024-11-11 21:12:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:25,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126519471] [2024-11-11 21:12:25,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-11 21:12:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126519471] [2024-11-11 21:12:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126519471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:25,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:25,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966685410] [2024-11-11 21:12:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:25,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:25,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:25,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,185 INFO L87 Difference]: Start difference. First operand 325 states and 456 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 21:12:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:25,207 INFO L93 Difference]: Finished difference Result 567 states and 814 transitions. [2024-11-11 21:12:25,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:25,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2024-11-11 21:12:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:25,210 INFO L225 Difference]: With dead ends: 567 [2024-11-11 21:12:25,210 INFO L226 Difference]: Without dead ends: 327 [2024-11-11 21:12:25,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,211 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 0 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:25,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1057 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-11 21:12:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2024-11-11 21:12:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 264 states have internal predecessors, (347), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-11 21:12:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 453 transitions. [2024-11-11 21:12:25,220 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 453 transitions. Word has length 124 [2024-11-11 21:12:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:25,221 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 453 transitions. [2024-11-11 21:12:25,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 21:12:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 453 transitions. [2024-11-11 21:12:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:12:25,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:25,222 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:25,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:12:25,222 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:25,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash -844197338, now seen corresponding path program 1 times [2024-11-11 21:12:25,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:25,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104108373] [2024-11-11 21:12:25,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-11 21:12:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104108373] [2024-11-11 21:12:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104108373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:25,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099127975] [2024-11-11 21:12:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:25,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:25,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:25,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:25,309 INFO L87 Difference]: Start difference. First operand 325 states and 453 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 21:12:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:25,351 INFO L93 Difference]: Finished difference Result 530 states and 774 transitions. [2024-11-11 21:12:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:25,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2024-11-11 21:12:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:25,353 INFO L225 Difference]: With dead ends: 530 [2024-11-11 21:12:25,353 INFO L226 Difference]: Without dead ends: 323 [2024-11-11 21:12:25,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,354 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 7 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:25,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 738 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-11 21:12:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2024-11-11 21:12:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 259 states have (on average 1.332046332046332) internal successors, (345), 263 states have internal predecessors, (345), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-11 21:12:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 449 transitions. [2024-11-11 21:12:25,364 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 449 transitions. Word has length 157 [2024-11-11 21:12:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:25,364 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 449 transitions. [2024-11-11 21:12:25,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 21:12:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 449 transitions. [2024-11-11 21:12:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-11 21:12:25,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:25,366 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:25,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:12:25,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash -233735844, now seen corresponding path program 1 times [2024-11-11 21:12:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825960687] [2024-11-11 21:12:25,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 21:12:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-11 21:12:25,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:25,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825960687] [2024-11-11 21:12:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825960687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:25,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:25,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931277903] [2024-11-11 21:12:25,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:25,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:25,490 INFO L87 Difference]: Start difference. First operand 323 states and 449 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 21:12:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:25,535 INFO L93 Difference]: Finished difference Result 470 states and 670 transitions. [2024-11-11 21:12:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:25,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 176 [2024-11-11 21:12:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:25,537 INFO L225 Difference]: With dead ends: 470 [2024-11-11 21:12:25,537 INFO L226 Difference]: Without dead ends: 306 [2024-11-11 21:12:25,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,538 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 35 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:25,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 714 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-11 21:12:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-11 21:12:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 245 states have (on average 1.3224489795918368) internal successors, (324), 249 states have internal predecessors, (324), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-11 21:12:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 422 transitions. [2024-11-11 21:12:25,549 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 422 transitions. Word has length 176 [2024-11-11 21:12:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:25,549 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 422 transitions. [2024-11-11 21:12:25,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 21:12:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 422 transitions. [2024-11-11 21:12:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-11 21:12:25,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:25,551 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:25,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:12:25,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:25,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1725258332, now seen corresponding path program 1 times [2024-11-11 21:12:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:25,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452467930] [2024-11-11 21:12:25,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:25,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-11 21:12:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-11-11 21:12:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452467930] [2024-11-11 21:12:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452467930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:25,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712348939] [2024-11-11 21:12:25,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:25,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:25,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:25,698 INFO L87 Difference]: Start difference. First operand 306 states and 422 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 21:12:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:25,754 INFO L93 Difference]: Finished difference Result 453 states and 643 transitions. [2024-11-11 21:12:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:25,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 178 [2024-11-11 21:12:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:25,756 INFO L225 Difference]: With dead ends: 453 [2024-11-11 21:12:25,758 INFO L226 Difference]: Without dead ends: 287 [2024-11-11 21:12:25,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,760 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 30 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:25,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 718 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-11 21:12:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-11 21:12:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 229 states have (on average 1.314410480349345) internal successors, (301), 233 states have internal predecessors, (301), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-11 21:12:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 393 transitions. [2024-11-11 21:12:25,773 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 393 transitions. Word has length 178 [2024-11-11 21:12:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:25,773 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 393 transitions. [2024-11-11 21:12:25,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 21:12:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 393 transitions. [2024-11-11 21:12:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 21:12:25,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:25,775 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:25,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:12:25,775 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:25,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash 209603569, now seen corresponding path program 1 times [2024-11-11 21:12:25,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394972409] [2024-11-11 21:12:25,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-11 21:12:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-11 21:12:25,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394972409] [2024-11-11 21:12:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394972409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:25,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:25,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257542989] [2024-11-11 21:12:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:25,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,933 INFO L87 Difference]: Start difference. First operand 287 states and 393 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 21:12:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:25,953 INFO L93 Difference]: Finished difference Result 433 states and 613 transitions. [2024-11-11 21:12:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:25,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 179 [2024-11-11 21:12:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:25,956 INFO L225 Difference]: With dead ends: 433 [2024-11-11 21:12:25,956 INFO L226 Difference]: Without dead ends: 287 [2024-11-11 21:12:25,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,956 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:25,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1035 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-11 21:12:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-11 21:12:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 229 states have (on average 1.2882096069868996) internal successors, (295), 233 states have internal predecessors, (295), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-11 21:12:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 387 transitions. [2024-11-11 21:12:25,967 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 387 transitions. Word has length 179 [2024-11-11 21:12:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:25,967 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 387 transitions. [2024-11-11 21:12:25,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 21:12:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-11-11 21:12:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-11 21:12:25,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:25,969 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:25,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:12:25,970 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:25,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash -927323165, now seen corresponding path program 1 times [2024-11-11 21:12:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:25,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732531414] [2024-11-11 21:12:25,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-11 21:12:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-11 21:12:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:26,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732531414] [2024-11-11 21:12:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732531414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263932833] [2024-11-11 21:12:26,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:26,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:26,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:26,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:26,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:12:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:26,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-11 21:12:26,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-11 21:12:26,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263932833] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:26,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 21:12:26,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-11-11 21:12:26,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972433875] [2024-11-11 21:12:26,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:26,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:26,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:26,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:26,423 INFO L87 Difference]: Start difference. First operand 287 states and 387 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 21:12:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:26,461 INFO L93 Difference]: Finished difference Result 454 states and 635 transitions. [2024-11-11 21:12:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:26,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 186 [2024-11-11 21:12:26,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:26,464 INFO L225 Difference]: With dead ends: 454 [2024-11-11 21:12:26,464 INFO L226 Difference]: Without dead ends: 266 [2024-11-11 21:12:26,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:26,465 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 30 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:26,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 491 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-11 21:12:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-11 21:12:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 215 states have internal predecessors, (270), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-11 21:12:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 356 transitions. [2024-11-11 21:12:26,477 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 356 transitions. Word has length 186 [2024-11-11 21:12:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:26,478 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 356 transitions. [2024-11-11 21:12:26,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 21:12:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 356 transitions. [2024-11-11 21:12:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-11 21:12:26,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:26,480 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:26,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:12:26,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 21:12:26,684 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:26,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash 522512342, now seen corresponding path program 1 times [2024-11-11 21:12:26,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:26,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868937279] [2024-11-11 21:12:26,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:26,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-11 21:12:26,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:26,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868937279] [2024-11-11 21:12:26,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868937279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:26,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:26,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:26,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806534749] [2024-11-11 21:12:26,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:26,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:26,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:26,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:26,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:26,791 INFO L87 Difference]: Start difference. First operand 266 states and 356 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-11 21:12:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:26,814 INFO L93 Difference]: Finished difference Result 409 states and 573 transitions. [2024-11-11 21:12:26,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:26,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 210 [2024-11-11 21:12:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:26,816 INFO L225 Difference]: With dead ends: 409 [2024-11-11 21:12:26,816 INFO L226 Difference]: Without dead ends: 270 [2024-11-11 21:12:26,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:26,817 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:26,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 758 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-11 21:12:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-11 21:12:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 218 states have internal predecessors, (273), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-11 21:12:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 359 transitions. [2024-11-11 21:12:26,825 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 359 transitions. Word has length 210 [2024-11-11 21:12:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:26,826 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 359 transitions. [2024-11-11 21:12:26,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-11 21:12:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 359 transitions. [2024-11-11 21:12:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 21:12:26,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:26,827 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:26,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:12:26,827 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:26,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2072955924, now seen corresponding path program 1 times [2024-11-11 21:12:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:26,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846315198] [2024-11-11 21:12:26,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-11 21:12:26,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846315198] [2024-11-11 21:12:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846315198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44822244] [2024-11-11 21:12:26,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:26,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:26,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:26,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:26,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:12:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:27,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-11 21:12:27,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:27,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44822244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:27,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:27,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-11 21:12:27,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44765649] [2024-11-11 21:12:27,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:27,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:27,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:27,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:27,141 INFO L87 Difference]: Start difference. First operand 270 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-11 21:12:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:27,173 INFO L93 Difference]: Finished difference Result 418 states and 581 transitions. [2024-11-11 21:12:27,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:27,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 217 [2024-11-11 21:12:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:27,175 INFO L225 Difference]: With dead ends: 418 [2024-11-11 21:12:27,175 INFO L226 Difference]: Without dead ends: 275 [2024-11-11 21:12:27,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:27,176 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 4 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:27,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 760 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:27,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-11 21:12:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-11 21:12:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 218 states have (on average 1.2706422018348624) internal successors, (277), 222 states have internal predecessors, (277), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-11 21:12:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 363 transitions. [2024-11-11 21:12:27,187 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 363 transitions. Word has length 217 [2024-11-11 21:12:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:27,189 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 363 transitions. [2024-11-11 21:12:27,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-11 21:12:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 363 transitions. [2024-11-11 21:12:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-11 21:12:27,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:27,190 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:27,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:27,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:27,395 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:27,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:27,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1425681232, now seen corresponding path program 1 times [2024-11-11 21:12:27,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:27,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244962999] [2024-11-11 21:12:27,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:27,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-11 21:12:27,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244962999] [2024-11-11 21:12:27,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244962999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818759423] [2024-11-11 21:12:27,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:27,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:27,540 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:27,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 21:12:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:27,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-11 21:12:27,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818759423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:27,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:27,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-11 21:12:27,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511143850] [2024-11-11 21:12:27,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:27,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:27,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:27,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:27,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:27,726 INFO L87 Difference]: Start difference. First operand 275 states and 363 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-11 21:12:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:27,755 INFO L93 Difference]: Finished difference Result 422 states and 581 transitions. [2024-11-11 21:12:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:27,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 225 [2024-11-11 21:12:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:27,757 INFO L225 Difference]: With dead ends: 422 [2024-11-11 21:12:27,757 INFO L226 Difference]: Without dead ends: 274 [2024-11-11 21:12:27,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:27,758 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 5 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:27,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 750 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-11 21:12:27,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-11 21:12:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 218 states have (on average 1.2568807339449541) internal successors, (274), 221 states have internal predecessors, (274), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-11 21:12:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 358 transitions. [2024-11-11 21:12:27,769 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 358 transitions. Word has length 225 [2024-11-11 21:12:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:27,769 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 358 transitions. [2024-11-11 21:12:27,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-11 21:12:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 358 transitions. [2024-11-11 21:12:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-11 21:12:27,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:27,771 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:27,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:27,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:27,972 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:27,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1356260272, now seen corresponding path program 1 times [2024-11-11 21:12:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:27,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157114031] [2024-11-11 21:12:27,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-11 21:12:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157114031] [2024-11-11 21:12:28,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157114031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:28,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:28,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137710009] [2024-11-11 21:12:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:28,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:28,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:28,132 INFO L87 Difference]: Start difference. First operand 274 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-11 21:12:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:28,347 INFO L93 Difference]: Finished difference Result 420 states and 570 transitions. [2024-11-11 21:12:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:28,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 233 [2024-11-11 21:12:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:28,350 INFO L225 Difference]: With dead ends: 420 [2024-11-11 21:12:28,350 INFO L226 Difference]: Without dead ends: 273 [2024-11-11 21:12:28,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:28,351 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 62 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:28,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 467 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:12:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-11 21:12:28,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-11 21:12:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 218 states have (on average 1.2522935779816513) internal successors, (273), 220 states have internal predecessors, (273), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-11 21:12:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 355 transitions. [2024-11-11 21:12:28,383 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 355 transitions. Word has length 233 [2024-11-11 21:12:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:28,383 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 355 transitions. [2024-11-11 21:12:28,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-11 21:12:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 355 transitions. [2024-11-11 21:12:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-11 21:12:28,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:28,385 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:28,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:12:28,385 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:28,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2142269095, now seen corresponding path program 1 times [2024-11-11 21:12:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:28,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339241058] [2024-11-11 21:12:28,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-11 21:12:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:28,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339241058] [2024-11-11 21:12:28,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339241058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:28,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884876829] [2024-11-11 21:12:28,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:28,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:28,605 INFO L87 Difference]: Start difference. First operand 273 states and 355 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 21:12:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:29,047 INFO L93 Difference]: Finished difference Result 632 states and 851 transitions. [2024-11-11 21:12:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:12:29,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 234 [2024-11-11 21:12:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:29,050 INFO L225 Difference]: With dead ends: 632 [2024-11-11 21:12:29,050 INFO L226 Difference]: Without dead ends: 486 [2024-11-11 21:12:29,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:12:29,052 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 421 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:29,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 613 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-11 21:12:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 480. [2024-11-11 21:12:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 378 states have (on average 1.306878306878307) internal successors, (494), 380 states have internal predecessors, (494), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-11 21:12:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 634 transitions. [2024-11-11 21:12:29,090 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 634 transitions. Word has length 234 [2024-11-11 21:12:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:29,091 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 634 transitions. [2024-11-11 21:12:29,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 21:12:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 634 transitions. [2024-11-11 21:12:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-11 21:12:29,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:29,093 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:29,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:12:29,094 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:29,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1811435868, now seen corresponding path program 1 times [2024-11-11 21:12:29,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:29,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004917096] [2024-11-11 21:12:29,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:29,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-11 21:12:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-11 21:12:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:12:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-11 21:12:29,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004917096] [2024-11-11 21:12:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004917096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:29,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:29,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:29,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650997411] [2024-11-11 21:12:29,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:29,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:29,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:29,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:29,243 INFO L87 Difference]: Start difference. First operand 480 states and 634 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-11 21:12:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:29,590 INFO L93 Difference]: Finished difference Result 1049 states and 1436 transitions. [2024-11-11 21:12:29,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:29,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 267 [2024-11-11 21:12:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:29,594 INFO L225 Difference]: With dead ends: 1049 [2024-11-11 21:12:29,594 INFO L226 Difference]: Without dead ends: 768 [2024-11-11 21:12:29,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:29,595 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 221 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:29,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 463 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:12:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-11 21:12:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 599. [2024-11-11 21:12:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 472 states have (on average 1.3135593220338984) internal successors, (620), 478 states have internal predecessors, (620), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-11 21:12:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 790 transitions. [2024-11-11 21:12:29,651 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 790 transitions. Word has length 267 [2024-11-11 21:12:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:29,652 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 790 transitions. [2024-11-11 21:12:29,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-11 21:12:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 790 transitions. [2024-11-11 21:12:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-11 21:12:29,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:29,654 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:29,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:12:29,654 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:29,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:29,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1916258247, now seen corresponding path program 1 times [2024-11-11 21:12:29,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:29,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821283036] [2024-11-11 21:12:29,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:29,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-11 21:12:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-11 21:12:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-11 21:12:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-11 21:12:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-11 21:12:29,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821283036] [2024-11-11 21:12:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821283036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:29,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:29,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555919115] [2024-11-11 21:12:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:29,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:29,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:29,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:29,804 INFO L87 Difference]: Start difference. First operand 599 states and 790 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-11 21:12:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:30,180 INFO L93 Difference]: Finished difference Result 1323 states and 1794 transitions. [2024-11-11 21:12:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:30,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 268 [2024-11-11 21:12:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:30,185 INFO L225 Difference]: With dead ends: 1323 [2024-11-11 21:12:30,185 INFO L226 Difference]: Without dead ends: 956 [2024-11-11 21:12:30,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:30,187 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 222 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:30,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 491 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:12:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-11 21:12:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 948. [2024-11-11 21:12:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 741 states have (on average 1.3400809716599191) internal successors, (993), 755 states have internal predecessors, (993), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2024-11-11 21:12:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1271 transitions. [2024-11-11 21:12:30,249 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1271 transitions. Word has length 268 [2024-11-11 21:12:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:30,251 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1271 transitions. [2024-11-11 21:12:30,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-11 21:12:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1271 transitions. [2024-11-11 21:12:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-11 21:12:30,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:30,253 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:30,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:12:30,254 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:30,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash -349092137, now seen corresponding path program 1 times [2024-11-11 21:12:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365449455] [2024-11-11 21:12:30,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:12:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-11 21:12:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-11 21:12:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-11 21:12:30,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365449455] [2024-11-11 21:12:30,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365449455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:30,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:30,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660912666] [2024-11-11 21:12:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:30,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:30,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:30,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:30,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:30,390 INFO L87 Difference]: Start difference. First operand 948 states and 1271 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:30,773 INFO L93 Difference]: Finished difference Result 2208 states and 3033 transitions. [2024-11-11 21:12:30,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:30,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 269 [2024-11-11 21:12:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:30,780 INFO L225 Difference]: With dead ends: 2208 [2024-11-11 21:12:30,780 INFO L226 Difference]: Without dead ends: 1532 [2024-11-11 21:12:30,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:30,782 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 222 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:30,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 518 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:12:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-11 21:12:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1518. [2024-11-11 21:12:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1179 states have (on average 1.364715860899067) internal successors, (1609), 1207 states have internal predecessors, (1609), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-11 21:12:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2071 transitions. [2024-11-11 21:12:30,883 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2071 transitions. Word has length 269 [2024-11-11 21:12:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:30,884 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 2071 transitions. [2024-11-11 21:12:30,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2071 transitions. [2024-11-11 21:12:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-11 21:12:30,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:30,886 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:30,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:12:30,887 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:30,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash -743458923, now seen corresponding path program 1 times [2024-11-11 21:12:30,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:30,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238562149] [2024-11-11 21:12:30,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:30,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:12:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-11 21:12:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-11 21:12:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-11 21:12:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238562149] [2024-11-11 21:12:31,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238562149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464917686] [2024-11-11 21:12:31,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:31,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:31,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:31,143 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:31,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 21:12:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:12:31,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-11 21:12:31,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:31,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464917686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:31,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:31,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-11 21:12:31,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202041495] [2024-11-11 21:12:31,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:31,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:31,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:31,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:31,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:12:31,374 INFO L87 Difference]: Start difference. First operand 1518 states and 2071 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:31,529 INFO L93 Difference]: Finished difference Result 2804 states and 3882 transitions. [2024-11-11 21:12:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:31,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 269 [2024-11-11 21:12:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:31,536 INFO L225 Difference]: With dead ends: 2804 [2024-11-11 21:12:31,536 INFO L226 Difference]: Without dead ends: 1518 [2024-11-11 21:12:31,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:12:31,539 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 31 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:31,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 685 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-11 21:12:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1518. [2024-11-11 21:12:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1179 states have (on average 1.344359626802375) internal successors, (1585), 1207 states have internal predecessors, (1585), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-11 21:12:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2047 transitions. [2024-11-11 21:12:31,615 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2047 transitions. Word has length 269 [2024-11-11 21:12:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:31,615 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 2047 transitions. [2024-11-11 21:12:31,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2047 transitions. [2024-11-11 21:12:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-11 21:12:31,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:31,618 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:31,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 21:12:31,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-11 21:12:31,819 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:31,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 407381820, now seen corresponding path program 1 times [2024-11-11 21:12:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:31,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432000695] [2024-11-11 21:12:31,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:12:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-11 21:12:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-11 21:12:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-11 21:12:32,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:32,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432000695] [2024-11-11 21:12:32,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432000695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:32,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693712991] [2024-11-11 21:12:32,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:32,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:32,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:32,104 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:32,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 21:12:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:12:32,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-11 21:12:32,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:32,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693712991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:32,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:32,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-11 21:12:32,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629371538] [2024-11-11 21:12:32,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:32,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:32,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:32,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:32,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:12:32,297 INFO L87 Difference]: Start difference. First operand 1518 states and 2047 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:32,413 INFO L93 Difference]: Finished difference Result 2804 states and 3826 transitions. [2024-11-11 21:12:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:32,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 270 [2024-11-11 21:12:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:32,422 INFO L225 Difference]: With dead ends: 2804 [2024-11-11 21:12:32,422 INFO L226 Difference]: Without dead ends: 1566 [2024-11-11 21:12:32,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:12:32,425 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 7 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:32,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 693 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-11 21:12:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-11 21:12:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1219 states have (on average 1.3461853978671041) internal successors, (1641), 1247 states have internal predecessors, (1641), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-11 21:12:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2103 transitions. [2024-11-11 21:12:32,513 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2103 transitions. Word has length 270 [2024-11-11 21:12:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:32,514 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2103 transitions. [2024-11-11 21:12:32,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2103 transitions. [2024-11-11 21:12:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-11 21:12:32,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:32,517 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:32,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:32,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-11 21:12:32,718 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:32,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1806296465, now seen corresponding path program 1 times [2024-11-11 21:12:32,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:32,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235019612] [2024-11-11 21:12:32,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:32,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:12:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-11 21:12:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-11 21:12:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-11 21:12:33,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235019612] [2024-11-11 21:12:33,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235019612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:33,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:12:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367364343] [2024-11-11 21:12:33,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:33,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:12:33,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:12:33,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:12:33,043 INFO L87 Difference]: Start difference. First operand 1566 states and 2103 transitions. Second operand has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-11 21:12:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:33,555 INFO L93 Difference]: Finished difference Result 2388 states and 3434 transitions. [2024-11-11 21:12:33,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:12:33,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 271 [2024-11-11 21:12:33,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:33,564 INFO L225 Difference]: With dead ends: 2388 [2024-11-11 21:12:33,565 INFO L226 Difference]: Without dead ends: 2386 [2024-11-11 21:12:33,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:12:33,566 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 179 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:33,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1526 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2024-11-11 21:12:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1614. [2024-11-11 21:12:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1251 states have (on average 1.337330135891287) internal successors, (1673), 1287 states have internal predecessors, (1673), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2024-11-11 21:12:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2151 transitions. [2024-11-11 21:12:33,666 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2151 transitions. Word has length 271 [2024-11-11 21:12:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:33,666 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2151 transitions. [2024-11-11 21:12:33,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-11 21:12:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2151 transitions. [2024-11-11 21:12:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-11 21:12:33,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:33,670 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:33,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 21:12:33,670 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:33,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1178133577, now seen corresponding path program 1 times [2024-11-11 21:12:33,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:33,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274118779] [2024-11-11 21:12:33,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:12:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-11 21:12:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-11 21:12:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-11 21:12:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-11 21:12:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:34,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274118779] [2024-11-11 21:12:34,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274118779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:34,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365674562] [2024-11-11 21:12:34,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:34,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:34,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:34,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:34,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 21:12:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 21:12:34,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-11 21:12:34,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-11 21:12:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365674562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:34,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:34,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2024-11-11 21:12:34,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046528624] [2024-11-11 21:12:34,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:34,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 21:12:34,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:34,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 21:12:34,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:12:34,700 INFO L87 Difference]: Start difference. First operand 1614 states and 2151 transitions. Second operand has 19 states, 19 states have (on average 8.0) internal successors, (152), 14 states have internal predecessors, (152), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-11 21:12:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:36,144 INFO L93 Difference]: Finished difference Result 3962 states and 5472 transitions. [2024-11-11 21:12:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 21:12:36,144 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.0) internal successors, (152), 14 states have internal predecessors, (152), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 279 [2024-11-11 21:12:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:36,154 INFO L225 Difference]: With dead ends: 3962 [2024-11-11 21:12:36,154 INFO L226 Difference]: Without dead ends: 2628 [2024-11-11 21:12:36,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 603 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 21:12:36,158 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 304 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:36,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2432 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 21:12:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2024-11-11 21:12:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2408. [2024-11-11 21:12:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 1862 states have (on average 1.3286788399570355) internal successors, (2474), 1914 states have internal predecessors, (2474), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2024-11-11 21:12:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3194 transitions. [2024-11-11 21:12:36,282 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3194 transitions. Word has length 279 [2024-11-11 21:12:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:36,282 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 3194 transitions. [2024-11-11 21:12:36,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.0) internal successors, (152), 14 states have internal predecessors, (152), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-11 21:12:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3194 transitions. [2024-11-11 21:12:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-11 21:12:36,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:36,286 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:36,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 21:12:36,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:36,487 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash -216519560, now seen corresponding path program 1 times [2024-11-11 21:12:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567747554] [2024-11-11 21:12:36,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:12:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-11 21:12:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-11 21:12:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-11 21:12:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-11 21:12:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:36,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567747554] [2024-11-11 21:12:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567747554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:36,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610259574] [2024-11-11 21:12:36,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:36,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:36,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:36,648 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:36,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 21:12:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:36,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:36,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-11 21:12:36,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610259574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:36,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:36,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-11 21:12:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417500888] [2024-11-11 21:12:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:36,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:36,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:36,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:36,825 INFO L87 Difference]: Start difference. First operand 2408 states and 3194 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 21:12:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:36,958 INFO L93 Difference]: Finished difference Result 4649 states and 6264 transitions. [2024-11-11 21:12:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:36,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 279 [2024-11-11 21:12:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:36,967 INFO L225 Difference]: With dead ends: 4649 [2024-11-11 21:12:36,967 INFO L226 Difference]: Without dead ends: 2344 [2024-11-11 21:12:36,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:36,972 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:36,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 693 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2024-11-11 21:12:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2344. [2024-11-11 21:12:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1818 states have (on average 1.3113311331133113) internal successors, (2384), 1870 states have internal predecessors, (2384), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2024-11-11 21:12:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3068 transitions. [2024-11-11 21:12:37,110 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3068 transitions. Word has length 279 [2024-11-11 21:12:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:37,111 INFO L471 AbstractCegarLoop]: Abstraction has 2344 states and 3068 transitions. [2024-11-11 21:12:37,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 21:12:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3068 transitions. [2024-11-11 21:12:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-11 21:12:37,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:37,118 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:37,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:37,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:37,320 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:37,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash -487785417, now seen corresponding path program 1 times [2024-11-11 21:12:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701627106] [2024-11-11 21:12:37,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 21:12:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 21:12:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-11 21:12:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-11 21:12:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-11 21:12:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-11 21:12:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-11 21:12:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-11 21:12:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-11 21:12:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-11-11 21:12:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701627106] [2024-11-11 21:12:37,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701627106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266054580] [2024-11-11 21:12:37,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:37,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:37,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:37,470 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:37,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 21:12:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:37,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-11-11 21:12:37,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266054580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:37,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:37,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-11 21:12:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555438697] [2024-11-11 21:12:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:37,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:37,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:37,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:37,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:37,665 INFO L87 Difference]: Start difference. First operand 2344 states and 3068 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 21:12:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:37,801 INFO L93 Difference]: Finished difference Result 4431 states and 5905 transitions. [2024-11-11 21:12:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:37,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 282 [2024-11-11 21:12:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:37,811 INFO L225 Difference]: With dead ends: 4431 [2024-11-11 21:12:37,811 INFO L226 Difference]: Without dead ends: 2172 [2024-11-11 21:12:37,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:37,816 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 4 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:37,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 721 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2024-11-11 21:12:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2172. [2024-11-11 21:12:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 1676 states have (on average 1.3048926014319808) internal successors, (2187), 1728 states have internal predecessors, (2187), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2024-11-11 21:12:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2833 transitions. [2024-11-11 21:12:38,006 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2833 transitions. Word has length 282 [2024-11-11 21:12:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:38,006 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 2833 transitions. [2024-11-11 21:12:38,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 21:12:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2833 transitions. [2024-11-11 21:12:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-11-11 21:12:38,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:38,009 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:38,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:38,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:38,210 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:38,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1403066076, now seen corresponding path program 1 times [2024-11-11 21:12:38,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:38,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208395272] [2024-11-11 21:12:38,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:38,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:12:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-11 21:12:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-11 21:12:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-11 21:12:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-11 21:12:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-11 21:12:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-11-11 21:12:38,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208395272] [2024-11-11 21:12:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208395272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342873247] [2024-11-11 21:12:38,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:38,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:38,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:38,534 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:38,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 21:12:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 21:12:38,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-11 21:12:38,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:38,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342873247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:38,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:38,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2024-11-11 21:12:38,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072644727] [2024-11-11 21:12:38,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:38,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:12:38,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:38,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:12:38,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:12:38,847 INFO L87 Difference]: Start difference. First operand 2172 states and 2833 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-11 21:12:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:39,499 INFO L93 Difference]: Finished difference Result 7058 states and 9187 transitions. [2024-11-11 21:12:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:12:39,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 294 [2024-11-11 21:12:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:39,519 INFO L225 Difference]: With dead ends: 7058 [2024-11-11 21:12:39,519 INFO L226 Difference]: Without dead ends: 5460 [2024-11-11 21:12:39,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-11 21:12:39,524 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 624 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:39,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 2855 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:12:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5460 states. [2024-11-11 21:12:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5460 to 5188. [2024-11-11 21:12:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 3969 states have (on average 1.2950365331317713) internal successors, (5140), 4097 states have internal predecessors, (5140), 787 states have call successors, (787), 431 states have call predecessors, (787), 431 states have return successors, (787), 667 states have call predecessors, (787), 787 states have call successors, (787) [2024-11-11 21:12:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 6714 transitions. [2024-11-11 21:12:39,804 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 6714 transitions. Word has length 294 [2024-11-11 21:12:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:39,805 INFO L471 AbstractCegarLoop]: Abstraction has 5188 states and 6714 transitions. [2024-11-11 21:12:39,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-11 21:12:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 6714 transitions. [2024-11-11 21:12:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-11 21:12:39,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:39,807 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:39,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-11 21:12:40,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-11 21:12:40,012 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:40,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1391814303, now seen corresponding path program 1 times [2024-11-11 21:12:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358698163] [2024-11-11 21:12:40,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:12:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-11 21:12:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-11 21:12:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-11 21:12:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-11 21:12:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:12:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-11-11 21:12:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358698163] [2024-11-11 21:12:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358698163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:40,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:40,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:12:40,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746286478] [2024-11-11 21:12:40,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:40,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:12:40,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:40,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:12:40,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:12:40,197 INFO L87 Difference]: Start difference. First operand 5188 states and 6714 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-11 21:12:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:40,641 INFO L93 Difference]: Finished difference Result 10402 states and 13727 transitions. [2024-11-11 21:12:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:12:40,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 300 [2024-11-11 21:12:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:40,659 INFO L225 Difference]: With dead ends: 10402 [2024-11-11 21:12:40,659 INFO L226 Difference]: Without dead ends: 5728 [2024-11-11 21:12:40,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:12:40,669 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 98 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:40,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 670 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:12:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5728 states. [2024-11-11 21:12:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5728 to 5620. [2024-11-11 21:12:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 4317 states have (on average 1.3055362520268705) internal successors, (5636), 4445 states have internal predecessors, (5636), 871 states have call successors, (871), 431 states have call predecessors, (871), 431 states have return successors, (871), 751 states have call predecessors, (871), 871 states have call successors, (871) [2024-11-11 21:12:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 7378 transitions. [2024-11-11 21:12:41,070 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 7378 transitions. Word has length 300 [2024-11-11 21:12:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:41,070 INFO L471 AbstractCegarLoop]: Abstraction has 5620 states and 7378 transitions. [2024-11-11 21:12:41,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-11 21:12:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 7378 transitions. [2024-11-11 21:12:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-11 21:12:41,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:41,073 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 21:12:41,074 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1072738013, now seen corresponding path program 1 times [2024-11-11 21:12:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912814409] [2024-11-11 21:12:41,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:12:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:12:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-11 21:12:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-11 21:12:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-11 21:12:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-11 21:12:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:12:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2024-11-11 21:12:41,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:41,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912814409] [2024-11-11 21:12:41,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912814409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:41,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:12:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359779385] [2024-11-11 21:12:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:41,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:12:41,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:41,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:12:41,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:41,416 INFO L87 Difference]: Start difference. First operand 5620 states and 7378 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 21:12:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:41,915 INFO L93 Difference]: Finished difference Result 10571 states and 13925 transitions. [2024-11-11 21:12:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:12:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 300 [2024-11-11 21:12:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:41,933 INFO L225 Difference]: With dead ends: 10571 [2024-11-11 21:12:41,933 INFO L226 Difference]: Without dead ends: 5529 [2024-11-11 21:12:41,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:12:41,943 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 61 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:41,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 771 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:12:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5529 states. [2024-11-11 21:12:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5529 to 5529. [2024-11-11 21:12:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5529 states, 4241 states have (on average 1.303701957085593) internal successors, (5529), 4361 states have internal predecessors, (5529), 864 states have call successors, (864), 424 states have call predecessors, (864), 423 states have return successors, (863), 750 states have call predecessors, (863), 863 states have call successors, (863) [2024-11-11 21:12:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 7256 transitions. [2024-11-11 21:12:42,265 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 7256 transitions. Word has length 300 [2024-11-11 21:12:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:42,266 INFO L471 AbstractCegarLoop]: Abstraction has 5529 states and 7256 transitions. [2024-11-11 21:12:42,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 21:12:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 7256 transitions. [2024-11-11 21:12:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-11 21:12:42,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:42,269 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:42,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 21:12:42,269 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -732264696, now seen corresponding path program 1 times [2024-11-11 21:12:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650997371] [2024-11-11 21:12:42,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:12:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 21:12:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:12:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-11 21:12:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-11 21:12:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-11 21:12:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-11-11 21:12:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-11 21:12:42,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:42,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650997371] [2024-11-11 21:12:42,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650997371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:42,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367863083] [2024-11-11 21:12:42,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:42,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:42,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:42,638 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:42,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-11 21:12:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 21:12:42,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2024-11-11 21:12:42,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367863083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2024-11-11 21:12:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548735679] [2024-11-11 21:12:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:42,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:12:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:42,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:12:42,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:12:42,946 INFO L87 Difference]: Start difference. First operand 5529 states and 7256 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-11 21:12:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:43,432 INFO L93 Difference]: Finished difference Result 12705 states and 16658 transitions. [2024-11-11 21:12:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:12:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 305 [2024-11-11 21:12:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:43,455 INFO L225 Difference]: With dead ends: 12705 [2024-11-11 21:12:43,455 INFO L226 Difference]: Without dead ends: 7703 [2024-11-11 21:12:43,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:12:43,466 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 124 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:43,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1721 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7703 states. [2024-11-11 21:12:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7703 to 6705. [2024-11-11 21:12:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6705 states, 5137 states have (on average 1.2990072026474595) internal successors, (6673), 5287 states have internal predecessors, (6673), 1050 states have call successors, (1050), 518 states have call predecessors, (1050), 517 states have return successors, (1049), 906 states have call predecessors, (1049), 1049 states have call successors, (1049) [2024-11-11 21:12:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 8772 transitions. [2024-11-11 21:12:43,999 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 8772 transitions. Word has length 305 [2024-11-11 21:12:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:44,000 INFO L471 AbstractCegarLoop]: Abstraction has 6705 states and 8772 transitions. [2024-11-11 21:12:44,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-11 21:12:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 8772 transitions. [2024-11-11 21:12:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-11 21:12:44,004 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:44,004 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:44,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-11 21:12:44,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-11 21:12:44,205 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:44,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:44,205 INFO L85 PathProgramCache]: Analyzing trace with hash -56931576, now seen corresponding path program 1 times [2024-11-11 21:12:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:44,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276138765] [2024-11-11 21:12:44,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:12:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 21:12:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:12:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-11 21:12:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-11 21:12:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-11 21:12:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-11-11 21:12:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-11 21:12:44,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276138765] [2024-11-11 21:12:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276138765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095541754] [2024-11-11 21:12:44,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:44,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:44,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:44,558 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:44,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-11 21:12:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 21:12:44,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 195 proven. 4 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-11 21:12:44,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-11 21:12:44,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095541754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:44,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:44,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2024-11-11 21:12:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73114387] [2024-11-11 21:12:44,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:44,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:12:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:12:44,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:12:44,978 INFO L87 Difference]: Start difference. First operand 6705 states and 8772 transitions. Second operand has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (32), 5 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-11 21:12:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:46,292 INFO L93 Difference]: Finished difference Result 13281 states and 17328 transitions. [2024-11-11 21:12:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 21:12:46,292 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (32), 5 states have call predecessors, (32), 4 states have call successors, (32) Word has length 305 [2024-11-11 21:12:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:46,313 INFO L225 Difference]: With dead ends: 13281 [2024-11-11 21:12:46,313 INFO L226 Difference]: Without dead ends: 7257 [2024-11-11 21:12:46,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 21:12:46,325 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 679 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:46,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 2255 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:12:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7257 states. [2024-11-11 21:12:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7257 to 6509. [2024-11-11 21:12:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6509 states, 4989 states have (on average 1.291842052515534) internal successors, (6445), 5135 states have internal predecessors, (6445), 1006 states have call successors, (1006), 514 states have call predecessors, (1006), 513 states have return successors, (1005), 866 states have call predecessors, (1005), 1005 states have call successors, (1005) [2024-11-11 21:12:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 8456 transitions. [2024-11-11 21:12:46,687 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 8456 transitions. Word has length 305 [2024-11-11 21:12:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:46,688 INFO L471 AbstractCegarLoop]: Abstraction has 6509 states and 8456 transitions. [2024-11-11 21:12:46,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (32), 5 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-11 21:12:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 8456 transitions. [2024-11-11 21:12:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-11 21:12:46,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:46,692 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:46,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:46,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-11 21:12:46,896 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:46,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:46,897 INFO L85 PathProgramCache]: Analyzing trace with hash -655363898, now seen corresponding path program 1 times [2024-11-11 21:12:46,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:46,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139855142] [2024-11-11 21:12:46,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:46,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:46,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:12:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 21:12:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:12:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-11 21:12:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-11 21:12:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-11 21:12:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-11-11 21:12:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2024-11-11 21:12:47,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:47,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139855142] [2024-11-11 21:12:47,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139855142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:47,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:47,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:47,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815198321] [2024-11-11 21:12:47,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:47,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:47,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:47,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:47,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:47,053 INFO L87 Difference]: Start difference. First operand 6509 states and 8456 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-11 21:12:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:47,833 INFO L93 Difference]: Finished difference Result 11945 states and 15594 transitions. [2024-11-11 21:12:47,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:12:47,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 305 [2024-11-11 21:12:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:47,853 INFO L225 Difference]: With dead ends: 11945 [2024-11-11 21:12:47,853 INFO L226 Difference]: Without dead ends: 6219 [2024-11-11 21:12:47,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:12:47,863 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 307 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:47,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 555 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2024-11-11 21:12:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 5975. [2024-11-11 21:12:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5975 states, 4580 states have (on average 1.2945414847161572) internal successors, (5929), 4711 states have internal predecessors, (5929), 927 states have call successors, (927), 468 states have call predecessors, (927), 467 states have return successors, (926), 802 states have call predecessors, (926), 926 states have call successors, (926) [2024-11-11 21:12:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5975 states to 5975 states and 7782 transitions. [2024-11-11 21:12:48,289 INFO L78 Accepts]: Start accepts. Automaton has 5975 states and 7782 transitions. Word has length 305 [2024-11-11 21:12:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:48,290 INFO L471 AbstractCegarLoop]: Abstraction has 5975 states and 7782 transitions. [2024-11-11 21:12:48,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-11 21:12:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5975 states and 7782 transitions. [2024-11-11 21:12:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-11-11 21:12:48,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:48,293 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:48,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-11 21:12:48,293 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:48,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:48,294 INFO L85 PathProgramCache]: Analyzing trace with hash 996206097, now seen corresponding path program 1 times [2024-11-11 21:12:48,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:48,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346222183] [2024-11-11 21:12:48,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:48,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:12:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 21:12:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:12:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 21:12:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-11 21:12:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-11 21:12:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:12:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-11-11 21:12:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-11-11 21:12:48,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:48,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346222183] [2024-11-11 21:12:48,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346222183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:48,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:48,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:48,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512225548] [2024-11-11 21:12:48,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:48,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:48,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:48,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:48,498 INFO L87 Difference]: Start difference. First operand 5975 states and 7782 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-11 21:12:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:49,405 INFO L93 Difference]: Finished difference Result 9803 states and 12849 transitions. [2024-11-11 21:12:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:12:49,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 311 [2024-11-11 21:12:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:49,426 INFO L225 Difference]: With dead ends: 9803 [2024-11-11 21:12:49,426 INFO L226 Difference]: Without dead ends: 4608 [2024-11-11 21:12:49,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:12:49,436 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 356 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:49,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1003 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:12:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2024-11-11 21:12:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4582. [2024-11-11 21:12:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 3519 states have (on average 1.2776356919579426) internal successors, (4496), 3616 states have internal predecessors, (4496), 716 states have call successors, (716), 346 states have call predecessors, (716), 346 states have return successors, (716), 619 states have call predecessors, (716), 716 states have call successors, (716) [2024-11-11 21:12:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 5928 transitions. [2024-11-11 21:12:49,693 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 5928 transitions. Word has length 311 [2024-11-11 21:12:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:49,694 INFO L471 AbstractCegarLoop]: Abstraction has 4582 states and 5928 transitions. [2024-11-11 21:12:49,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-11 21:12:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 5928 transitions. [2024-11-11 21:12:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-11 21:12:49,701 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:49,701 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:49,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-11 21:12:49,701 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:49,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:49,702 INFO L85 PathProgramCache]: Analyzing trace with hash 197121380, now seen corresponding path program 1 times [2024-11-11 21:12:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744692580] [2024-11-11 21:12:49,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:49,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:12:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 21:12:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:12:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 21:12:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-11 21:12:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-11 21:12:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:12:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-11 21:12:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-11 21:12:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-11-11 21:12:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-11 21:12:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-11 21:12:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-11 21:12:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-11 21:12:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2024-11-11 21:12:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:50,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744692580] [2024-11-11 21:12:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744692580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:50,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:12:50,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245208158] [2024-11-11 21:12:50,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:50,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:12:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:50,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:12:50,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:12:50,514 INFO L87 Difference]: Start difference. First operand 4582 states and 5928 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-11 21:12:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:51,441 INFO L93 Difference]: Finished difference Result 10465 states and 13460 transitions. [2024-11-11 21:12:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:12:51,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 361 [2024-11-11 21:12:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:51,462 INFO L225 Difference]: With dead ends: 10465 [2024-11-11 21:12:51,462 INFO L226 Difference]: Without dead ends: 6670 [2024-11-11 21:12:51,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:12:51,470 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 136 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:51,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1172 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:12:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2024-11-11 21:12:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6158. [2024-11-11 21:12:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6158 states, 4711 states have (on average 1.2651241774570154) internal successors, (5960), 4836 states have internal predecessors, (5960), 920 states have call successors, (920), 474 states have call predecessors, (920), 526 states have return successors, (996), 847 states have call predecessors, (996), 920 states have call successors, (996) [2024-11-11 21:12:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6158 states to 6158 states and 7876 transitions. [2024-11-11 21:12:51,886 INFO L78 Accepts]: Start accepts. Automaton has 6158 states and 7876 transitions. Word has length 361 [2024-11-11 21:12:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:51,886 INFO L471 AbstractCegarLoop]: Abstraction has 6158 states and 7876 transitions. [2024-11-11 21:12:51,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-11 21:12:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 6158 states and 7876 transitions. [2024-11-11 21:12:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-11 21:12:51,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:51,895 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:51,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-11 21:12:51,895 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash 607875, now seen corresponding path program 1 times [2024-11-11 21:12:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:51,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12168954] [2024-11-11 21:12:51,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:51,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:12:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 21:12:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:12:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 21:12:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-11 21:12:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-11 21:12:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:12:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-11 21:12:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-11 21:12:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-11-11 21:12:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-11 21:12:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-11 21:12:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-11 21:12:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-11 21:12:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2024-11-11 21:12:52,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:52,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12168954] [2024-11-11 21:12:52,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12168954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:52,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:52,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:52,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17610991] [2024-11-11 21:12:52,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:52,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:52,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:52,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:52,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:52,067 INFO L87 Difference]: Start difference. First operand 6158 states and 7876 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:12:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:52,655 INFO L93 Difference]: Finished difference Result 12413 states and 15855 transitions. [2024-11-11 21:12:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:12:52,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 361 [2024-11-11 21:12:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:52,675 INFO L225 Difference]: With dead ends: 12413 [2024-11-11 21:12:52,675 INFO L226 Difference]: Without dead ends: 5950 [2024-11-11 21:12:52,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:12:52,683 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 100 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:52,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 600 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:12:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2024-11-11 21:12:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 5950. [2024-11-11 21:12:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5950 states, 4555 states have (on average 1.2278814489571899) internal successors, (5593), 4680 states have internal predecessors, (5593), 920 states have call successors, (920), 474 states have call predecessors, (920), 474 states have return successors, (920), 795 states have call predecessors, (920), 920 states have call successors, (920) [2024-11-11 21:12:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5950 states to 5950 states and 7433 transitions. [2024-11-11 21:12:53,004 INFO L78 Accepts]: Start accepts. Automaton has 5950 states and 7433 transitions. Word has length 361 [2024-11-11 21:12:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:53,005 INFO L471 AbstractCegarLoop]: Abstraction has 5950 states and 7433 transitions. [2024-11-11 21:12:53,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:12:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5950 states and 7433 transitions. [2024-11-11 21:12:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-11 21:12:53,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:53,015 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:53,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-11 21:12:53,015 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:53,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:53,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1895443369, now seen corresponding path program 1 times [2024-11-11 21:12:53,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:53,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942264134] [2024-11-11 21:12:53,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:53,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:12:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:12:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:12:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:12:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 21:12:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:12:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 21:12:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-11 21:12:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-11 21:12:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:12:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-11 21:12:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-11 21:12:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-11-11 21:12:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-11 21:12:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-11 21:12:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-11-11 21:12:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-11-11 21:12:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-11 21:12:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-11-11 21:12:53,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:53,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942264134] [2024-11-11 21:12:53,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942264134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:53,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390690339] [2024-11-11 21:12:53,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:53,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:53,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:53,617 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:53,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-11 21:12:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-11 21:12:53,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2024-11-11 21:12:54,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-11-11 21:12:54,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390690339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:54,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:54,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 12] total 23 [2024-11-11 21:12:54,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451873494] [2024-11-11 21:12:54,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:54,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 21:12:54,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:54,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 21:12:54,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:12:54,972 INFO L87 Difference]: Start difference. First operand 5950 states and 7433 transitions. Second operand has 23 states, 22 states have (on average 12.681818181818182) internal successors, (279), 21 states have internal predecessors, (279), 15 states have call successors, (69), 8 states have call predecessors, (69), 6 states have return successors, (62), 14 states have call predecessors, (62), 14 states have call successors, (62) [2024-11-11 21:13:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:01,760 INFO L93 Difference]: Finished difference Result 30686 states and 40977 transitions. [2024-11-11 21:13:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-11-11 21:13:01,761 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 12.681818181818182) internal successors, (279), 21 states have internal predecessors, (279), 15 states have call successors, (69), 8 states have call predecessors, (69), 6 states have return successors, (62), 14 states have call predecessors, (62), 14 states have call successors, (62) Word has length 371 [2024-11-11 21:13:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:01,835 INFO L225 Difference]: With dead ends: 30686 [2024-11-11 21:13:01,836 INFO L226 Difference]: Without dead ends: 25595 [2024-11-11 21:13:01,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 844 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6641 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2343, Invalid=15479, Unknown=0, NotChecked=0, Total=17822 [2024-11-11 21:13:01,854 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 3651 mSDsluCounter, 5835 mSDsCounter, 0 mSdLazyCounter, 5742 mSolverCounterSat, 1201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3656 SdHoareTripleChecker+Valid, 6553 SdHoareTripleChecker+Invalid, 6943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1201 IncrementalHoareTripleChecker+Valid, 5742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:01,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3656 Valid, 6553 Invalid, 6943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1201 Valid, 5742 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 21:13:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25595 states. [2024-11-11 21:13:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25595 to 6666. [2024-11-11 21:13:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6666 states, 5128 states have (on average 1.2295241809672386) internal successors, (6305), 5312 states have internal predecessors, (6305), 1008 states have call successors, (1008), 529 states have call predecessors, (1008), 529 states have return successors, (1008), 824 states have call predecessors, (1008), 1008 states have call successors, (1008) [2024-11-11 21:13:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 8321 transitions. [2024-11-11 21:13:02,600 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 8321 transitions. Word has length 371 [2024-11-11 21:13:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:02,600 INFO L471 AbstractCegarLoop]: Abstraction has 6666 states and 8321 transitions. [2024-11-11 21:13:02,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 12.681818181818182) internal successors, (279), 21 states have internal predecessors, (279), 15 states have call successors, (69), 8 states have call predecessors, (69), 6 states have return successors, (62), 14 states have call predecessors, (62), 14 states have call successors, (62) [2024-11-11 21:13:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 8321 transitions. [2024-11-11 21:13:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-11 21:13:02,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:02,610 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:02,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-11 21:13:02,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-11 21:13:02,810 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:02,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash -437949269, now seen corresponding path program 1 times [2024-11-11 21:13:02,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:02,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029918137] [2024-11-11 21:13:02,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:13:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:13:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:13:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:13:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:13:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:13:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:13:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:13:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:13:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:13:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:13:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:13:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:13:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:13:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:13:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:13:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:13:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:13:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:13:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:13:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:13:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:13:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 21:13:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:13:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 21:13:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-11 21:13:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-11 21:13:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:13:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-11 21:13:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-11 21:13:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-11-11 21:13:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-11 21:13:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-11 21:13:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-11-11 21:13:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-11-11 21:13:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-11 21:13:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2024-11-11 21:13:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029918137] [2024-11-11 21:13:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029918137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:03,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:03,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:13:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490388017] [2024-11-11 21:13:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:13:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:13:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:13:03,071 INFO L87 Difference]: Start difference. First operand 6666 states and 8321 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-11 21:13:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:04,201 INFO L93 Difference]: Finished difference Result 12660 states and 15915 transitions. [2024-11-11 21:13:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:13:04,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 371 [2024-11-11 21:13:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:04,225 INFO L225 Difference]: With dead ends: 12660 [2024-11-11 21:13:04,225 INFO L226 Difference]: Without dead ends: 6961 [2024-11-11 21:13:04,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:13:04,236 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 207 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:04,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1698 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:13:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6961 states. [2024-11-11 21:13:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6961 to 6412. [2024-11-11 21:13:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6412 states, 4920 states have (on average 1.2315040650406504) internal successors, (6059), 5122 states have internal predecessors, (6059), 972 states have call successors, (972), 519 states have call predecessors, (972), 519 states have return successors, (972), 770 states have call predecessors, (972), 972 states have call successors, (972) [2024-11-11 21:13:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 8003 transitions. [2024-11-11 21:13:04,870 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 8003 transitions. Word has length 371 [2024-11-11 21:13:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:04,870 INFO L471 AbstractCegarLoop]: Abstraction has 6412 states and 8003 transitions. [2024-11-11 21:13:04,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-11 21:13:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 8003 transitions. [2024-11-11 21:13:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-11 21:13:04,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:04,879 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:04,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-11 21:13:04,880 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:04,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1960073136, now seen corresponding path program 1 times [2024-11-11 21:13:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671323648] [2024-11-11 21:13:04,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:13:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:13:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:13:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:13:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:13:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:13:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:13:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:13:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:13:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:13:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:13:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:13:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:13:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:13:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:13:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:13:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:13:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:13:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:13:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:13:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:13:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-11 21:13:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-11 21:13:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-11 21:13:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-11 21:13:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-11 21:13:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-11 21:13:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-11 21:13:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-11-11 21:13:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-11-11 21:13:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-11-11 21:13:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-11-11 21:13:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2024-11-11 21:13:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-11-11 21:13:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-11-11 21:13:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-11 21:13:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2024-11-11 21:13:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671323648] [2024-11-11 21:13:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671323648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:13:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945347895] [2024-11-11 21:13:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:05,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:13:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:13:05,972 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:13:05,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-11 21:13:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:06,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-11 21:13:06,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:13:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 303 proven. 70 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2024-11-11 21:13:06,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:13:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-11-11 21:13:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945347895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:13:07,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:13:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 13] total 37 [2024-11-11 21:13:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459528073] [2024-11-11 21:13:07,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:13:07,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-11 21:13:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-11 21:13:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 21:13:07,214 INFO L87 Difference]: Start difference. First operand 6412 states and 8003 transitions. Second operand has 37 states, 36 states have (on average 8.777777777777779) internal successors, (316), 34 states have internal predecessors, (316), 19 states have call successors, (76), 8 states have call predecessors, (76), 7 states have return successors, (74), 19 states have call predecessors, (74), 18 states have call successors, (74) [2024-11-11 21:13:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:25,062 INFO L93 Difference]: Finished difference Result 50058 states and 67227 transitions. [2024-11-11 21:13:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2024-11-11 21:13:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 8.777777777777779) internal successors, (316), 34 states have internal predecessors, (316), 19 states have call successors, (76), 8 states have call predecessors, (76), 7 states have return successors, (74), 19 states have call predecessors, (74), 18 states have call successors, (74) Word has length 372 [2024-11-11 21:13:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:25,183 INFO L225 Difference]: With dead ends: 50058 [2024-11-11 21:13:25,183 INFO L226 Difference]: Without dead ends: 44613 [2024-11-11 21:13:25,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23314 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5923, Invalid=55333, Unknown=0, NotChecked=0, Total=61256 [2024-11-11 21:13:25,217 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 4108 mSDsluCounter, 13598 mSDsCounter, 0 mSdLazyCounter, 15163 mSolverCounterSat, 1483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 14370 SdHoareTripleChecker+Invalid, 16646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1483 IncrementalHoareTripleChecker+Valid, 15163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:25,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 14370 Invalid, 16646 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1483 Valid, 15163 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-11 21:13:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44613 states. [2024-11-11 21:13:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44613 to 9680. [2024-11-11 21:13:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9680 states, 7366 states have (on average 1.234455606842248) internal successors, (9093), 7723 states have internal predecessors, (9093), 1523 states have call successors, (1523), 790 states have call predecessors, (1523), 790 states have return successors, (1523), 1166 states have call predecessors, (1523), 1523 states have call successors, (1523) [2024-11-11 21:13:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9680 states to 9680 states and 12139 transitions. [2024-11-11 21:13:26,838 INFO L78 Accepts]: Start accepts. Automaton has 9680 states and 12139 transitions. Word has length 372 [2024-11-11 21:13:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:26,838 INFO L471 AbstractCegarLoop]: Abstraction has 9680 states and 12139 transitions. [2024-11-11 21:13:26,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 8.777777777777779) internal successors, (316), 34 states have internal predecessors, (316), 19 states have call successors, (76), 8 states have call predecessors, (76), 7 states have return successors, (74), 19 states have call predecessors, (74), 18 states have call successors, (74) [2024-11-11 21:13:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9680 states and 12139 transitions. [2024-11-11 21:13:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-11 21:13:26,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:26,853 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:26,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-11 21:13:27,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:13:27,054 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:27,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash -339454648, now seen corresponding path program 1 times [2024-11-11 21:13:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505269159] [2024-11-11 21:13:27,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:13:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:13:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:13:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:13:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:13:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:13:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:13:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:13:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:13:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:13:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:13:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:13:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:13:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:13:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:13:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:13:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-11 21:13:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-11 21:13:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:13:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-11 21:13:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-11 21:13:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:13:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-11 21:13:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-11 21:13:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-11 21:13:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-11 21:13:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-11 21:13:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-11 21:13:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2024-11-11 21:13:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-11 21:13:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-11-11 21:13:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-11-11 21:13:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-11-11 21:13:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-11-11 21:13:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-11-11 21:13:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-11 21:13:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2024-11-11 21:13:27,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505269159] [2024-11-11 21:13:27,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505269159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:13:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076072663] [2024-11-11 21:13:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:27,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:13:27,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:13:27,829 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:13:27,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-11 21:13:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:28,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-11 21:13:28,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:13:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 260 proven. 116 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2024-11-11 21:13:28,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:13:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2024-11-11 21:13:29,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076072663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:13:29,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:13:29,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 18] total 41 [2024-11-11 21:13:29,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776158420] [2024-11-11 21:13:29,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:13:29,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-11 21:13:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:29,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-11 21:13:29,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1476, Unknown=0, NotChecked=0, Total=1640 [2024-11-11 21:13:29,213 INFO L87 Difference]: Start difference. First operand 9680 states and 12139 transitions. Second operand has 41 states, 40 states have (on average 8.45) internal successors, (338), 37 states have internal predecessors, (338), 18 states have call successors, (76), 8 states have call predecessors, (76), 9 states have return successors, (75), 19 states have call predecessors, (75), 17 states have call successors, (75)