./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:17:38,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:17:38,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:17:38,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:17:38,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:17:38,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:17:38,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:17:38,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:17:38,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:17:38,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:17:38,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:17:38,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:17:38,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:17:38,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:17:38,740 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:17:38,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:17:38,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:17:38,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:17:38,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:17:38,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:17:38,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:17:38,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:17:38,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:17:38,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:17:38,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:17:38,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:17:38,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:17:38,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:17:38,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:17:38,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:17:38,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:17:38,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:17:38,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:17:38,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:17:38,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:17:38,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:17:38,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:17:38,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:17:38,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:17:38,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:17:38,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:17:38,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:17:38,750 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-clean/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-clean/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 -> 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 [2024-10-11 03:17:39,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:17:39,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:17:39,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:17:39,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:17:39,057 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:17:39,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-10-11 03:17:40,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:17:40,785 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:17:40,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-10-11 03:17:40,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4797d52d4/78e88d66323d48fc864bbb0959cc615a/FLAGa7e2c7086 [2024-10-11 03:17:40,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4797d52d4/78e88d66323d48fc864bbb0959cc615a [2024-10-11 03:17:40,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:17:40,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:17:40,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:17:40,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:17:40,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:17:40,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:17:40" (1/1) ... [2024-10-11 03:17:40,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b139c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:40, skipping insertion in model container [2024-10-11 03:17:40,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:17:40" (1/1) ... [2024-10-11 03:17:40,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:17:41,186 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2024-10-11 03:17:41,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:17:41,208 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:17:41,273 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2024-10-11 03:17:41,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:17:41,302 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:17:41,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41 WrapperNode [2024-10-11 03:17:41,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:17:41,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:17:41,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:17:41,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:17:41,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,378 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 421 [2024-10-11 03:17:41,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:17:41,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:17:41,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:17:41,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:17:41,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,435 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:17:41,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:17:41,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:17:41,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:17:41,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:17:41,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (1/1) ... [2024-10-11 03:17:41,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:17:41,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:41,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:17:41,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:17:41,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:17:41,611 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-10-11 03:17:41,611 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-10-11 03:17:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-11 03:17:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-11 03:17:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-10-11 03:17:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-10-11 03:17:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-10-11 03:17:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-10-11 03:17:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-10-11 03:17:41,613 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-10-11 03:17:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 03:17:41,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 03:17:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:17:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:17:41,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:17:41,708 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:17:41,710 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:17:42,317 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-10-11 03:17:42,317 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:17:42,375 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:17:42,376 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 03:17:42,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:17:42 BoogieIcfgContainer [2024-10-11 03:17:42,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:17:42,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:17:42,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:17:42,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:17:42,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:17:40" (1/3) ... [2024-10-11 03:17:42,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5775dc43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:17:42, skipping insertion in model container [2024-10-11 03:17:42,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:41" (2/3) ... [2024-10-11 03:17:42,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5775dc43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:17:42, skipping insertion in model container [2024-10-11 03:17:42,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:17:42" (3/3) ... [2024-10-11 03:17:42,387 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-10-11 03:17:42,404 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:17:42,404 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:17:42,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:17:42,492 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;@67c07deb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:17:42,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:17:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 130 states have (on average 1.6076923076923078) internal successors, (209), 135 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-10-11 03:17:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 03:17:42,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:42,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:42,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2074964955, now seen corresponding path program 1 times [2024-10-11 03:17:42,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:42,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099654219] [2024-10-11 03:17:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099654219] [2024-10-11 03:17:42,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099654219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:42,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:42,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620907731] [2024-10-11 03:17:42,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:42,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:42,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:42,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:42,936 INFO L87 Difference]: Start difference. First operand has 175 states, 130 states have (on average 1.6076923076923078) internal successors, (209), 135 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 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-10-11 03:17:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:43,093 INFO L93 Difference]: Finished difference Result 352 states and 607 transitions. [2024-10-11 03:17:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:43,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 14 [2024-10-11 03:17:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:43,111 INFO L225 Difference]: With dead ends: 352 [2024-10-11 03:17:43,111 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 03:17:43,120 INFO L431 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-10-11 03:17:43,125 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 7 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:43,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 797 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 03:17:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-10-11 03:17:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 134 states have (on average 1.5671641791044777) internal successors, (210), 138 states have internal predecessors, (210), 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-10-11 03:17:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 284 transitions. [2024-10-11 03:17:43,185 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 284 transitions. Word has length 14 [2024-10-11 03:17:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:43,186 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 284 transitions. [2024-10-11 03:17:43,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-10-11 03:17:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 284 transitions. [2024-10-11 03:17:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 03:17:43,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:43,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:43,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:17:43,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:43,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:43,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1470326834, now seen corresponding path program 1 times [2024-10-11 03:17:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906889580] [2024-10-11 03:17:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:43,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:43,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906889580] [2024-10-11 03:17:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906889580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:43,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:43,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536224855] [2024-10-11 03:17:43,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:43,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:43,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:43,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:43,325 INFO L87 Difference]: Start difference. First operand 179 states and 284 transitions. 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), 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-10-11 03:17:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:43,411 INFO L93 Difference]: Finished difference Result 372 states and 592 transitions. [2024-10-11 03:17:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:43,411 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), 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 15 [2024-10-11 03:17:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:43,414 INFO L225 Difference]: With dead ends: 372 [2024-10-11 03:17:43,415 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 03:17:43,416 INFO L431 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-10-11 03:17:43,417 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 25 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:43,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 813 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 03:17:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-10-11 03:17:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 145 states have (on average 1.5448275862068965) internal successors, (224), 149 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-10-11 03:17:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 300 transitions. [2024-10-11 03:17:43,438 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 300 transitions. Word has length 15 [2024-10-11 03:17:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:43,438 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 300 transitions. [2024-10-11 03:17:43,439 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), 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-10-11 03:17:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 300 transitions. [2024-10-11 03:17:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:17:43,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:43,445 INFO L215 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] [2024-10-11 03:17:43,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:17:43,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:43,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash -451822646, now seen corresponding path program 1 times [2024-10-11 03:17:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530273324] [2024-10-11 03:17:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:43,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:43,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530273324] [2024-10-11 03:17:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530273324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:43,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:43,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775249038] [2024-10-11 03:17:43,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:43,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:43,585 INFO L87 Difference]: Start difference. First operand 192 states and 300 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 03:17:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:43,625 INFO L93 Difference]: Finished difference Result 404 states and 638 transitions. [2024-10-11 03:17:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:43,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 23 [2024-10-11 03:17:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:43,631 INFO L225 Difference]: With dead ends: 404 [2024-10-11 03:17:43,634 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 03:17:43,635 INFO L431 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-10-11 03:17:43,636 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 22 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:43,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 550 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 03:17:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2024-10-11 03:17:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 151 states have internal predecessors, (226), 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-10-11 03:17:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 302 transitions. [2024-10-11 03:17:43,655 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 302 transitions. Word has length 23 [2024-10-11 03:17:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:43,655 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 302 transitions. [2024-10-11 03:17:43,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 03:17:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 302 transitions. [2024-10-11 03:17:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 03:17:43,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:43,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:43,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:17:43,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:43,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash 628615801, now seen corresponding path program 1 times [2024-10-11 03:17:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:43,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202115922] [2024-10-11 03:17:43,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202115922] [2024-10-11 03:17:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202115922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913530431] [2024-10-11 03:17:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:43,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:43,805 INFO L87 Difference]: Start difference. First operand 194 states and 302 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-10-11 03:17:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:43,878 INFO L93 Difference]: Finished difference Result 379 states and 594 transitions. [2024-10-11 03:17:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:43,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 31 [2024-10-11 03:17:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:43,882 INFO L225 Difference]: With dead ends: 379 [2024-10-11 03:17:43,882 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 03:17:43,887 INFO L431 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-10-11 03:17:43,888 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:43,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1088 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 03:17:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2024-10-11 03:17:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 154 states have internal predecessors, (229), 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-10-11 03:17:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2024-10-11 03:17:43,913 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 31 [2024-10-11 03:17:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:43,913 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2024-10-11 03:17:43,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-10-11 03:17:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2024-10-11 03:17:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:17:43,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:43,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:43,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:17:43,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:43,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash 873027383, now seen corresponding path program 1 times [2024-10-11 03:17:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:43,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218566057] [2024-10-11 03:17:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:17:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:44,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:44,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218566057] [2024-10-11 03:17:44,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218566057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:44,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:44,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:17:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872377217] [2024-10-11 03:17:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:44,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:17:44,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:17:44,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:17:44,048 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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-10-11 03:17:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:44,130 INFO L93 Difference]: Finished difference Result 342 states and 535 transitions. [2024-10-11 03:17:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:17:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 34 [2024-10-11 03:17:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:44,134 INFO L225 Difference]: With dead ends: 342 [2024-10-11 03:17:44,138 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 03:17:44,139 INFO L431 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-10-11 03:17:44,140 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:44,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1322 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 03:17:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-10-11 03:17:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 151 states have internal predecessors, (221), 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-10-11 03:17:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 297 transitions. [2024-10-11 03:17:44,163 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 297 transitions. Word has length 34 [2024-10-11 03:17:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:44,163 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 297 transitions. [2024-10-11 03:17:44,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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-10-11 03:17:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 297 transitions. [2024-10-11 03:17:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:17:44,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:44,166 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:44,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:17:44,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:44,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2012797693, now seen corresponding path program 1 times [2024-10-11 03:17:44,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:44,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740169874] [2024-10-11 03:17:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:44,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:44,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740169874] [2024-10-11 03:17:44,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740169874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:44,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694905372] [2024-10-11 03:17:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:44,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:44,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:17:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:17:44,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:44,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694905372] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:44,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-11 03:17:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317282861] [2024-10-11 03:17:44,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:44,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:44,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:44,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:44,512 INFO L87 Difference]: Start difference. First operand 194 states and 297 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-10-11 03:17:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:44,584 INFO L93 Difference]: Finished difference Result 437 states and 682 transitions. [2024-10-11 03:17:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:44,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2024-10-11 03:17:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:44,589 INFO L225 Difference]: With dead ends: 437 [2024-10-11 03:17:44,589 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 03:17:44,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 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-10-11 03:17:44,591 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 75 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:44,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 803 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 03:17:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247. [2024-10-11 03:17:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 194 states have internal predecessors, (280), 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-10-11 03:17:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 376 transitions. [2024-10-11 03:17:44,615 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 376 transitions. Word has length 34 [2024-10-11 03:17:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:44,615 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 376 transitions. [2024-10-11 03:17:44,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-10-11 03:17:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 376 transitions. [2024-10-11 03:17:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:17:44,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:44,618 INFO L215 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] [2024-10-11 03:17:44,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 03:17:44,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:44,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash 661632675, now seen corresponding path program 2 times [2024-10-11 03:17:44,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621177099] [2024-10-11 03:17:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 03:17:44,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621177099] [2024-10-11 03:17:44,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621177099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:44,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:44,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:44,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919289664] [2024-10-11 03:17:44,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:44,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:44,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:44,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:44,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:44,933 INFO L87 Difference]: Start difference. First operand 247 states and 376 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-10-11 03:17:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:44,994 INFO L93 Difference]: Finished difference Result 473 states and 737 transitions. [2024-10-11 03:17:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:44,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 56 [2024-10-11 03:17:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:44,997 INFO L225 Difference]: With dead ends: 473 [2024-10-11 03:17:44,997 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 03:17:45,002 INFO L431 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-10-11 03:17:45,003 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 8 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:45,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 787 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 03:17:45,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-10-11 03:17:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 196 states have (on average 1.469387755102041) internal successors, (288), 200 states have internal predecessors, (288), 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-10-11 03:17:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2024-10-11 03:17:45,025 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 56 [2024-10-11 03:17:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:45,026 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2024-10-11 03:17:45,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-10-11 03:17:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2024-10-11 03:17:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:17:45,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:45,028 INFO L215 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] [2024-10-11 03:17:45,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:17:45,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:45,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash 714322674, now seen corresponding path program 1 times [2024-10-11 03:17:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:45,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134381804] [2024-10-11 03:17:45,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 03:17:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134381804] [2024-10-11 03:17:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134381804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:45,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:45,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174840332] [2024-10-11 03:17:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:45,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:45,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:45,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:45,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:45,146 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-10-11 03:17:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:45,203 INFO L93 Difference]: Finished difference Result 519 states and 795 transitions. [2024-10-11 03:17:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 56 [2024-10-11 03:17:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:45,206 INFO L225 Difference]: With dead ends: 519 [2024-10-11 03:17:45,206 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 03:17:45,207 INFO L431 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-10-11 03:17:45,208 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 24 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:45,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 805 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 03:17:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2024-10-11 03:17:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 228 states have (on average 1.4254385964912282) internal successors, (325), 232 states have internal predecessors, (325), 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-10-11 03:17:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 427 transitions. [2024-10-11 03:17:45,222 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 427 transitions. Word has length 56 [2024-10-11 03:17:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:45,223 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 427 transitions. [2024-10-11 03:17:45,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-10-11 03:17:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 427 transitions. [2024-10-11 03:17:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:17:45,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:45,224 INFO L215 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] [2024-10-11 03:17:45,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:17:45,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:45,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:45,225 INFO L85 PathProgramCache]: Analyzing trace with hash -545843192, now seen corresponding path program 1 times [2024-10-11 03:17:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:45,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131400693] [2024-10-11 03:17:45,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:45,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:45,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131400693] [2024-10-11 03:17:45,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131400693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:45,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:45,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641518837] [2024-10-11 03:17:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:45,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:45,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:45,360 INFO L87 Difference]: Start difference. First operand 290 states and 427 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-10-11 03:17:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:45,404 INFO L93 Difference]: Finished difference Result 530 states and 794 transitions. [2024-10-11 03:17:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:45,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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 74 [2024-10-11 03:17:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:45,409 INFO L225 Difference]: With dead ends: 530 [2024-10-11 03:17:45,409 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 03:17:45,411 INFO L431 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-10-11 03:17:45,411 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 0 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:45,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1075 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 03:17:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2024-10-11 03:17:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 228 states have (on average 1.412280701754386) internal successors, (322), 232 states have internal predecessors, (322), 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-10-11 03:17:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2024-10-11 03:17:45,432 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 74 [2024-10-11 03:17:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:45,432 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2024-10-11 03:17:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-10-11 03:17:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2024-10-11 03:17:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:17:45,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:45,435 INFO L215 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] [2024-10-11 03:17:45,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:17:45,435 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:45,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:45,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1447243218, now seen corresponding path program 1 times [2024-10-11 03:17:45,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:45,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549111526] [2024-10-11 03:17:45,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:45,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 03:17:45,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:45,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549111526] [2024-10-11 03:17:45,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549111526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:45,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:45,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:45,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583373429] [2024-10-11 03:17:45,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:45,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:45,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:45,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:45,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:45,597 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-11 03:17:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:45,659 INFO L93 Difference]: Finished difference Result 567 states and 850 transitions. [2024-10-11 03:17:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:45,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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 103 [2024-10-11 03:17:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:45,663 INFO L225 Difference]: With dead ends: 567 [2024-10-11 03:17:45,663 INFO L226 Difference]: Without dead ends: 334 [2024-10-11 03:17:45,664 INFO L431 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-10-11 03:17:45,665 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 25 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:45,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 805 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-11 03:17:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2024-10-11 03:17:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 265 states have (on average 1.3735849056603773) internal successors, (364), 269 states have internal predecessors, (364), 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-10-11 03:17:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 472 transitions. [2024-10-11 03:17:45,685 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 472 transitions. Word has length 103 [2024-10-11 03:17:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:45,685 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 472 transitions. [2024-10-11 03:17:45,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-11 03:17:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 472 transitions. [2024-10-11 03:17:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:17:45,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:45,688 INFO L215 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] [2024-10-11 03:17:45,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:17:45,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:45,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:45,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2118149951, now seen corresponding path program 1 times [2024-10-11 03:17:45,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:45,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664344709] [2024-10-11 03:17:45,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:45,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-10-11 03:17:45,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:45,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664344709] [2024-10-11 03:17:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664344709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:45,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:45,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909223498] [2024-10-11 03:17:45,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:45,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:45,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:45,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:45,892 INFO L87 Difference]: Start difference. First operand 331 states and 472 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-10-11 03:17:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:45,954 INFO L93 Difference]: Finished difference Result 593 states and 870 transitions. [2024-10-11 03:17:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:45,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-10-11 03:17:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:45,958 INFO L225 Difference]: With dead ends: 593 [2024-10-11 03:17:45,958 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 03:17:45,960 INFO L431 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-10-11 03:17:45,960 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 9 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:45,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 770 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 03:17:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2024-10-11 03:17:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 260 states have (on average 1.353846153846154) internal successors, (352), 264 states have internal predecessors, (352), 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-10-11 03:17:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 458 transitions. [2024-10-11 03:17:45,980 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 458 transitions. Word has length 104 [2024-10-11 03:17:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:45,982 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 458 transitions. [2024-10-11 03:17:45,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-10-11 03:17:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 458 transitions. [2024-10-11 03:17:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 03:17:45,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:45,983 INFO L215 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] [2024-10-11 03:17:45,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:17:45,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:45,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash 644396980, now seen corresponding path program 1 times [2024-10-11 03:17:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:45,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100567379] [2024-10-11 03:17:45,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-10-11 03:17:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:46,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100567379] [2024-10-11 03:17:46,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100567379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:46,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:46,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495862076] [2024-10-11 03:17:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:46,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:46,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:46,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:46,168 INFO L87 Difference]: Start difference. First operand 325 states and 458 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-10-11 03:17:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:46,205 INFO L93 Difference]: Finished difference Result 568 states and 819 transitions. [2024-10-11 03:17:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:46,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 123 [2024-10-11 03:17:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:46,208 INFO L225 Difference]: With dead ends: 568 [2024-10-11 03:17:46,208 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 03:17:46,209 INFO L431 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-10-11 03:17:46,210 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 0 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:46,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1059 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 03:17:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2024-10-11 03:17:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 260 states have (on average 1.3423076923076922) internal successors, (349), 264 states have internal predecessors, (349), 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-10-11 03:17:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 455 transitions. [2024-10-11 03:17:46,229 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 455 transitions. Word has length 123 [2024-10-11 03:17:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:46,229 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 455 transitions. [2024-10-11 03:17:46,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-10-11 03:17:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 455 transitions. [2024-10-11 03:17:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:17:46,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:46,233 INFO L215 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] [2024-10-11 03:17:46,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:17:46,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:46,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2015312998, now seen corresponding path program 1 times [2024-10-11 03:17:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978169824] [2024-10-11 03:17:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-11 03:17:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978169824] [2024-10-11 03:17:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978169824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:46,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936696941] [2024-10-11 03:17:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:46,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:46,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:46,417 INFO L87 Difference]: Start difference. First operand 325 states and 455 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-10-11 03:17:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:46,490 INFO L93 Difference]: Finished difference Result 531 states and 779 transitions. [2024-10-11 03:17:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 156 [2024-10-11 03:17:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:46,494 INFO L225 Difference]: With dead ends: 531 [2024-10-11 03:17:46,494 INFO L226 Difference]: Without dead ends: 323 [2024-10-11 03:17:46,499 INFO L431 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-10-11 03:17:46,500 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 7 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:46,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 738 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:46,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-11 03:17:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2024-10-11 03:17:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 259 states have (on average 1.3397683397683398) internal successors, (347), 263 states have internal predecessors, (347), 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-10-11 03:17:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 451 transitions. [2024-10-11 03:17:46,519 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 451 transitions. Word has length 156 [2024-10-11 03:17:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:46,520 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 451 transitions. [2024-10-11 03:17:46,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-10-11 03:17:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 451 transitions. [2024-10-11 03:17:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 03:17:46,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:46,522 INFO L215 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] [2024-10-11 03:17:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:17:46,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1851796518, now seen corresponding path program 1 times [2024-10-11 03:17:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:46,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039849205] [2024-10-11 03:17:46,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 03:17:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-10-11 03:17:46,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:46,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039849205] [2024-10-11 03:17:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039849205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:46,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279338985] [2024-10-11 03:17:46,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:46,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:46,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:46,731 INFO L87 Difference]: Start difference. First operand 323 states and 451 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 03:17:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:46,819 INFO L93 Difference]: Finished difference Result 471 states and 675 transitions. [2024-10-11 03:17:46,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:46,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 175 [2024-10-11 03:17:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:46,823 INFO L225 Difference]: With dead ends: 471 [2024-10-11 03:17:46,823 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 03:17:46,824 INFO L431 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-10-11 03:17:46,825 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 35 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:46,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 714 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 03:17:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-10-11 03:17:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 249 states have internal predecessors, (326), 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-10-11 03:17:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 424 transitions. [2024-10-11 03:17:46,845 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 424 transitions. Word has length 175 [2024-10-11 03:17:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:46,845 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 424 transitions. [2024-10-11 03:17:46,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 03:17:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 424 transitions. [2024-10-11 03:17:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 03:17:46,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:46,848 INFO L215 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] [2024-10-11 03:17:46,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:17:46,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:46,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1809752837, now seen corresponding path program 1 times [2024-10-11 03:17:46,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:46,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109588241] [2024-10-11 03:17:46,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:46,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 03:17:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-10-11 03:17:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109588241] [2024-10-11 03:17:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109588241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:47,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:47,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985609367] [2024-10-11 03:17:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:47,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:47,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:47,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:47,062 INFO L87 Difference]: Start difference. First operand 306 states and 424 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-10-11 03:17:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:47,126 INFO L93 Difference]: Finished difference Result 454 states and 648 transitions. [2024-10-11 03:17:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:47,127 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 177 [2024-10-11 03:17:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:47,130 INFO L225 Difference]: With dead ends: 454 [2024-10-11 03:17:47,130 INFO L226 Difference]: Without dead ends: 287 [2024-10-11 03:17:47,131 INFO L431 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-10-11 03:17:47,131 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 30 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:47,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 718 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-11 03:17:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-10-11 03:17:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 229 states have (on average 1.3231441048034935) internal successors, (303), 233 states have internal predecessors, (303), 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-10-11 03:17:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 395 transitions. [2024-10-11 03:17:47,145 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 395 transitions. Word has length 177 [2024-10-11 03:17:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:47,146 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 395 transitions. [2024-10-11 03:17:47,146 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-10-11 03:17:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 395 transitions. [2024-10-11 03:17:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 03:17:47,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:47,148 INFO L215 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] [2024-10-11 03:17:47,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:17:47,149 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:47,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash -90150298, now seen corresponding path program 1 times [2024-10-11 03:17:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:47,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553681913] [2024-10-11 03:17:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 03:17:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-11 03:17:47,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553681913] [2024-10-11 03:17:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553681913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:47,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:47,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830372857] [2024-10-11 03:17:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:47,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:47,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:47,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:47,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:47,362 INFO L87 Difference]: Start difference. First operand 287 states and 395 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-10-11 03:17:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:47,393 INFO L93 Difference]: Finished difference Result 434 states and 618 transitions. [2024-10-11 03:17:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:47,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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 178 [2024-10-11 03:17:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:47,396 INFO L225 Difference]: With dead ends: 434 [2024-10-11 03:17:47,396 INFO L226 Difference]: Without dead ends: 287 [2024-10-11 03:17:47,397 INFO L431 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-10-11 03:17:47,397 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1037 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-10-11 03:17:47,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1037 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-11 03:17:47,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-10-11 03:17:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 229 states have (on average 1.296943231441048) internal successors, (297), 233 states have internal predecessors, (297), 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-10-11 03:17:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 389 transitions. [2024-10-11 03:17:47,410 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 389 transitions. Word has length 178 [2024-10-11 03:17:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:47,410 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 389 transitions. [2024-10-11 03:17:47,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-10-11 03:17:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 389 transitions. [2024-10-11 03:17:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 03:17:47,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:47,413 INFO L215 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] [2024-10-11 03:17:47,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:17:47,413 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:47,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash -993656755, now seen corresponding path program 1 times [2024-10-11 03:17:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:47,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374201402] [2024-10-11 03:17:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:47,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 03:17:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-11 03:17:47,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:47,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374201402] [2024-10-11 03:17:47,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374201402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:47,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816957516] [2024-10-11 03:17:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:47,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:47,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:47,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:47,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:17:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 03:17:47,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-11 03:17:47,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-11 03:17:47,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816957516] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:47,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:17:47,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-10-11 03:17:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673485426] [2024-10-11 03:17:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:47,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:47,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:47,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:47,968 INFO L87 Difference]: Start difference. First operand 287 states and 389 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-10-11 03:17:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:48,024 INFO L93 Difference]: Finished difference Result 455 states and 640 transitions. [2024-10-11 03:17:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:48,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 185 [2024-10-11 03:17:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:48,044 INFO L225 Difference]: With dead ends: 455 [2024-10-11 03:17:48,044 INFO L226 Difference]: Without dead ends: 266 [2024-10-11 03:17:48,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:48,045 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 30 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:48,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 491 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-11 03:17:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-10-11 03:17:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 211 states have (on average 1.2890995260663507) internal successors, (272), 215 states have internal predecessors, (272), 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-10-11 03:17:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 358 transitions. [2024-10-11 03:17:48,060 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 358 transitions. Word has length 185 [2024-10-11 03:17:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:48,060 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 358 transitions. [2024-10-11 03:17:48,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-10-11 03:17:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 358 transitions. [2024-10-11 03:17:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 03:17:48,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:48,062 INFO L215 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] [2024-10-11 03:17:48,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:17:48,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 03:17:48,263 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:48,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1118713088, now seen corresponding path program 1 times [2024-10-11 03:17:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:48,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183701774] [2024-10-11 03:17:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-11 03:17:48,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:48,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183701774] [2024-10-11 03:17:48,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183701774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:48,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:48,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:48,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458204488] [2024-10-11 03:17:48,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:48,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:48,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:48,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:48,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:48,409 INFO L87 Difference]: Start difference. First operand 266 states and 358 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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-10-11 03:17:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:48,452 INFO L93 Difference]: Finished difference Result 410 states and 578 transitions. [2024-10-11 03:17:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:48,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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 209 [2024-10-11 03:17:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:48,455 INFO L225 Difference]: With dead ends: 410 [2024-10-11 03:17:48,455 INFO L226 Difference]: Without dead ends: 270 [2024-10-11 03:17:48,456 INFO L431 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-10-11 03:17:48,457 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:48,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 758 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-11 03:17:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-10-11 03:17:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.2850467289719627) internal successors, (275), 218 states have internal predecessors, (275), 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-10-11 03:17:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 361 transitions. [2024-10-11 03:17:48,471 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 361 transitions. Word has length 209 [2024-10-11 03:17:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:48,471 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 361 transitions. [2024-10-11 03:17:48,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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-10-11 03:17:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 361 transitions. [2024-10-11 03:17:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 03:17:48,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:48,476 INFO L215 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] [2024-10-11 03:17:48,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:17:48,476 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:48,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1972757185, now seen corresponding path program 1 times [2024-10-11 03:17:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:48,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929324953] [2024-10-11 03:17:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-11 03:17:48,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:48,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929324953] [2024-10-11 03:17:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929324953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:48,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111559147] [2024-10-11 03:17:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:48,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:48,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:48,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:48,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:17:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:48,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 03:17:48,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-11 03:17:48,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:17:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111559147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:48,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:17:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 03:17:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265814316] [2024-10-11 03:17:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:48,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:48,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:48,911 INFO L87 Difference]: Start difference. First operand 270 states and 361 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-10-11 03:17:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:48,962 INFO L93 Difference]: Finished difference Result 419 states and 586 transitions. [2024-10-11 03:17:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:48,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 216 [2024-10-11 03:17:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:48,966 INFO L225 Difference]: With dead ends: 419 [2024-10-11 03:17:48,966 INFO L226 Difference]: Without dead ends: 275 [2024-10-11 03:17:48,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:17:48,967 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 4 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:48,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 760 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-11 03:17:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-11 03:17:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 218 states have (on average 1.2798165137614679) internal successors, (279), 222 states have internal predecessors, (279), 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-10-11 03:17:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 365 transitions. [2024-10-11 03:17:48,983 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 365 transitions. Word has length 216 [2024-10-11 03:17:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:48,986 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 365 transitions. [2024-10-11 03:17:48,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-10-11 03:17:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 365 transitions. [2024-10-11 03:17:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 03:17:48,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:48,989 INFO L215 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] [2024-10-11 03:17:49,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:17:49,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:49,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:49,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash 375042395, now seen corresponding path program 1 times [2024-10-11 03:17:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698127700] [2024-10-11 03:17:49,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:49,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-10-11 03:17:49,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:49,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698127700] [2024-10-11 03:17:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698127700] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074503076] [2024-10-11 03:17:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:49,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:49,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:49,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:49,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:17:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:49,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 03:17:49,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-10-11 03:17:49,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:17:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074503076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:17:49,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 03:17:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827447239] [2024-10-11 03:17:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:49,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:49,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:49,652 INFO L87 Difference]: Start difference. First operand 275 states and 365 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-10-11 03:17:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:49,700 INFO L93 Difference]: Finished difference Result 423 states and 586 transitions. [2024-10-11 03:17:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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 224 [2024-10-11 03:17:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:49,703 INFO L225 Difference]: With dead ends: 423 [2024-10-11 03:17:49,703 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 03:17:49,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:17:49,705 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 5 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:49,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 750 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 03:17:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-10-11 03:17:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 218 states have (on average 1.2660550458715596) internal successors, (276), 221 states have internal predecessors, (276), 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-10-11 03:17:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 360 transitions. [2024-10-11 03:17:49,723 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 360 transitions. Word has length 224 [2024-10-11 03:17:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:49,724 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 360 transitions. [2024-10-11 03:17:49,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-10-11 03:17:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 360 transitions. [2024-10-11 03:17:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 03:17:49,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:49,727 INFO L215 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] [2024-10-11 03:17:49,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:17:49,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:49,929 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:49,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1160943845, now seen corresponding path program 1 times [2024-10-11 03:17:49,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:49,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674695554] [2024-10-11 03:17:49,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:49,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:17:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-10-11 03:17:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674695554] [2024-10-11 03:17:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674695554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589290787] [2024-10-11 03:17:50,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:50,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:50,140 INFO L87 Difference]: Start difference. First operand 274 states and 360 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-10-11 03:17:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:50,433 INFO L93 Difference]: Finished difference Result 421 states and 575 transitions. [2024-10-11 03:17:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:50,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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 232 [2024-10-11 03:17:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:50,437 INFO L225 Difference]: With dead ends: 421 [2024-10-11 03:17:50,437 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 03:17:50,437 INFO L431 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-10-11 03:17:50,438 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 62 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:50,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 470 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:17:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 03:17:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-10-11 03:17:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 218 states have (on average 1.261467889908257) internal successors, (275), 220 states have internal predecessors, (275), 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-10-11 03:17:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 357 transitions. [2024-10-11 03:17:50,492 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 357 transitions. Word has length 232 [2024-10-11 03:17:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:50,493 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 357 transitions. [2024-10-11 03:17:50,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-10-11 03:17:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 357 transitions. [2024-10-11 03:17:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 03:17:50,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:50,496 INFO L215 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-10-11 03:17:50,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:17:50,496 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:50,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 363670474, now seen corresponding path program 1 times [2024-10-11 03:17:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:50,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174933019] [2024-10-11 03:17:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:17:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-10-11 03:17:50,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174933019] [2024-10-11 03:17:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174933019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:50,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:50,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427226603] [2024-10-11 03:17:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:50,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:50,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:50,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:50,794 INFO L87 Difference]: Start difference. First operand 273 states and 357 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-10-11 03:17:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:51,381 INFO L93 Difference]: Finished difference Result 632 states and 855 transitions. [2024-10-11 03:17:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:51,382 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-10-11 03:17:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:51,387 INFO L225 Difference]: With dead ends: 632 [2024-10-11 03:17:51,387 INFO L226 Difference]: Without dead ends: 485 [2024-10-11 03:17:51,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 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-10-11 03:17:51,389 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 421 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:51,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 613 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:17:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-11 03:17:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 479. [2024-10-11 03:17:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 377 states have (on average 1.312997347480106) internal successors, (495), 379 states have internal predecessors, (495), 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-10-11 03:17:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 635 transitions. [2024-10-11 03:17:51,430 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 635 transitions. Word has length 234 [2024-10-11 03:17:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:51,431 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 635 transitions. [2024-10-11 03:17:51,431 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-10-11 03:17:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 635 transitions. [2024-10-11 03:17:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-10-11 03:17:51,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:51,435 INFO L215 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] [2024-10-11 03:17:51,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:17:51,435 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:51,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash 22352055, now seen corresponding path program 1 times [2024-10-11 03:17:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:51,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201065421] [2024-10-11 03:17:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:17:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-11 03:17:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-11 03:17:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-11 03:17:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-11 03:17:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-10-11 03:17:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201065421] [2024-10-11 03:17:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201065421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:51,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753709298] [2024-10-11 03:17:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:51,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:51,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:51,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:51,656 INFO L87 Difference]: Start difference. First operand 479 states and 635 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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-10-11 03:17:52,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:52,151 INFO L93 Difference]: Finished difference Result 1048 states and 1441 transitions. [2024-10-11 03:17:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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 265 [2024-10-11 03:17:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:52,157 INFO L225 Difference]: With dead ends: 1048 [2024-10-11 03:17:52,157 INFO L226 Difference]: Without dead ends: 767 [2024-10-11 03:17:52,158 INFO L431 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-10-11 03:17:52,159 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 225 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:52,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 467 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:17:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-10-11 03:17:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 598. [2024-10-11 03:17:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 471 states have (on average 1.3227176220806793) internal successors, (623), 477 states have internal predecessors, (623), 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-10-11 03:17:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 793 transitions. [2024-10-11 03:17:52,208 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 793 transitions. Word has length 265 [2024-10-11 03:17:52,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:52,209 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 793 transitions. [2024-10-11 03:17:52,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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-10-11 03:17:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 793 transitions. [2024-10-11 03:17:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-11 03:17:52,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:52,212 INFO L215 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] [2024-10-11 03:17:52,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:17:52,212 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:52,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash 569855187, now seen corresponding path program 1 times [2024-10-11 03:17:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081446003] [2024-10-11 03:17:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:17:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 03:17:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-11 03:17:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-11 03:17:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 03:17:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-10-11 03:17:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081446003] [2024-10-11 03:17:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081446003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:52,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:52,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:52,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611907357] [2024-10-11 03:17:52,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:52,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:52,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:52,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:52,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:52,399 INFO L87 Difference]: Start difference. First operand 598 states and 793 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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-10-11 03:17:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:52,940 INFO L93 Difference]: Finished difference Result 1322 states and 1805 transitions. [2024-10-11 03:17:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:52,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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 266 [2024-10-11 03:17:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:52,947 INFO L225 Difference]: With dead ends: 1322 [2024-10-11 03:17:52,947 INFO L226 Difference]: Without dead ends: 955 [2024-10-11 03:17:52,949 INFO L431 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-10-11 03:17:52,950 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 226 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:52,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 495 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:17:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-10-11 03:17:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 947. [2024-10-11 03:17:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 740 states have (on average 1.3513513513513513) internal successors, (1000), 754 states have internal predecessors, (1000), 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-10-11 03:17:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1278 transitions. [2024-10-11 03:17:53,058 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1278 transitions. Word has length 266 [2024-10-11 03:17:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:53,059 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1278 transitions. [2024-10-11 03:17:53,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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-10-11 03:17:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1278 transitions. [2024-10-11 03:17:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-11 03:17:53,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:53,063 INFO L215 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-10-11 03:17:53,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:17:53,063 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:53,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1524149778, now seen corresponding path program 1 times [2024-10-11 03:17:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:53,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996363523] [2024-10-11 03:17:53,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:53,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:17:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:17:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:17:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-11 03:17:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 03:17:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-10-11 03:17:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996363523] [2024-10-11 03:17:53,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996363523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:53,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:53,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:53,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163508022] [2024-10-11 03:17:53,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:53,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:53,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:53,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:53,239 INFO L87 Difference]: Start difference. First operand 947 states and 1278 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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-10-11 03:17:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:53,809 INFO L93 Difference]: Finished difference Result 2207 states and 3056 transitions. [2024-10-11 03:17:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:53,810 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), 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 267 [2024-10-11 03:17:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:53,825 INFO L225 Difference]: With dead ends: 2207 [2024-10-11 03:17:53,825 INFO L226 Difference]: Without dead ends: 1531 [2024-10-11 03:17:53,828 INFO L431 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-10-11 03:17:53,829 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 226 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:53,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 522 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:17:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-10-11 03:17:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1517. [2024-10-11 03:17:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1178 states have (on average 1.3786078098471986) internal successors, (1624), 1206 states have internal predecessors, (1624), 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-10-11 03:17:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2086 transitions. [2024-10-11 03:17:53,965 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2086 transitions. Word has length 267 [2024-10-11 03:17:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:53,966 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2086 transitions. [2024-10-11 03:17:53,966 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), 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-10-11 03:17:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2086 transitions. [2024-10-11 03:17:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-11 03:17:53,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:53,970 INFO L215 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-10-11 03:17:53,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:17:53,971 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:53,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1129782992, now seen corresponding path program 1 times [2024-10-11 03:17:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:53,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283465502] [2024-10-11 03:17:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:17:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:17:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:17:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-11 03:17:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 03:17:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-10-11 03:17:54,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283465502] [2024-10-11 03:17:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283465502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977556954] [2024-10-11 03:17:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:54,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:54,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:54,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:17:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:17:54,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-10-11 03:17:54,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:17:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977556954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:54,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:17:54,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-11 03:17:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245994566] [2024-10-11 03:17:54,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:54,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:54,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:54,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:54,574 INFO L87 Difference]: Start difference. First operand 1517 states and 2086 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-10-11 03:17:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:54,753 INFO L93 Difference]: Finished difference Result 2803 states and 3913 transitions. [2024-10-11 03:17:54,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:54,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 267 [2024-10-11 03:17:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:54,763 INFO L225 Difference]: With dead ends: 2803 [2024-10-11 03:17:54,763 INFO L226 Difference]: Without dead ends: 1517 [2024-10-11 03:17:54,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 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-10-11 03:17:54,768 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 31 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:54,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 685 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-10-11 03:17:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1517. [2024-10-11 03:17:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1178 states have (on average 1.3582342954159592) internal successors, (1600), 1206 states have internal predecessors, (1600), 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-10-11 03:17:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2062 transitions. [2024-10-11 03:17:54,922 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2062 transitions. Word has length 267 [2024-10-11 03:17:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:54,925 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2062 transitions. [2024-10-11 03:17:54,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-10-11 03:17:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2062 transitions. [2024-10-11 03:17:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-11 03:17:54,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:54,928 INFO L215 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] [2024-10-11 03:17:54,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:17:55,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 03:17:55,133 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:55,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:55,134 INFO L85 PathProgramCache]: Analyzing trace with hash 336998433, now seen corresponding path program 1 times [2024-10-11 03:17:55,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:55,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644960031] [2024-10-11 03:17:55,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:17:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:17:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:17:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:17:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 03:17:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-10-11 03:17:55,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:55,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644960031] [2024-10-11 03:17:55,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644960031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588104640] [2024-10-11 03:17:55,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:55,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:55,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:55,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:55,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:17:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:17:55,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-10-11 03:17:55,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:17:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588104640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:55,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:17:55,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-11 03:17:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4610156] [2024-10-11 03:17:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:55,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:55,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:55,689 INFO L87 Difference]: Start difference. First operand 1517 states and 2062 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-10-11 03:17:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:55,954 INFO L93 Difference]: Finished difference Result 2803 states and 3857 transitions. [2024-10-11 03:17:55,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:55,955 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 268 [2024-10-11 03:17:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:55,970 INFO L225 Difference]: With dead ends: 2803 [2024-10-11 03:17:55,970 INFO L226 Difference]: Without dead ends: 1565 [2024-10-11 03:17:55,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 315 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-10-11 03:17:55,976 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 7 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:55,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 693 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-10-11 03:17:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2024-10-11 03:17:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1218 states have (on average 1.3596059113300492) internal successors, (1656), 1246 states have internal predecessors, (1656), 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-10-11 03:17:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2118 transitions. [2024-10-11 03:17:56,158 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2118 transitions. Word has length 268 [2024-10-11 03:17:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:56,159 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2118 transitions. [2024-10-11 03:17:56,160 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-10-11 03:17:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2118 transitions. [2024-10-11 03:17:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-11 03:17:56,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:56,162 INFO L215 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] [2024-10-11 03:17:56,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 03:17:56,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 03:17:56,364 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:56,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:56,364 INFO L85 PathProgramCache]: Analyzing trace with hash -714521494, now seen corresponding path program 1 times [2024-10-11 03:17:56,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:56,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827437845] [2024-10-11 03:17:56,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:17:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:17:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:17:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:17:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 03:17:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-10-11 03:17:56,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:56,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827437845] [2024-10-11 03:17:56,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827437845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:56,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:56,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068148591] [2024-10-11 03:17:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:56,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:56,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:56,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:56,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:56,802 INFO L87 Difference]: Start difference. First operand 1565 states and 2118 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 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-10-11 03:17:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:57,516 INFO L93 Difference]: Finished difference Result 2387 states and 3465 transitions. [2024-10-11 03:17:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:57,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 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 269 [2024-10-11 03:17:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:57,531 INFO L225 Difference]: With dead ends: 2387 [2024-10-11 03:17:57,532 INFO L226 Difference]: Without dead ends: 2385 [2024-10-11 03:17:57,533 INFO L431 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-10-11 03:17:57,534 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 182 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:57,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1520 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:17:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-10-11 03:17:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1613. [2024-10-11 03:17:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1250 states have (on average 1.3504) internal successors, (1688), 1286 states have internal predecessors, (1688), 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-10-11 03:17:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2166 transitions. [2024-10-11 03:17:57,695 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2166 transitions. Word has length 269 [2024-10-11 03:17:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:57,696 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2166 transitions. [2024-10-11 03:17:57,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 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-10-11 03:17:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2166 transitions. [2024-10-11 03:17:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-11 03:17:57,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:57,699 INFO L215 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] [2024-10-11 03:17:57,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:17:57,699 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:57,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash -932347161, now seen corresponding path program 1 times [2024-10-11 03:17:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:57,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088822662] [2024-10-11 03:17:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:17:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:17:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:17:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:17:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:17:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:17:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:17:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:17:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:17:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:17:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:17:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:17:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:17:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:17:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:17:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 03:17:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-11 03:17:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-11 03:17:58,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088822662] [2024-10-11 03:17:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088822662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281568229] [2024-10-11 03:17:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:58,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:58,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:58,111 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:58,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:17:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:58,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:17:58,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-11 03:17:58,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-11 03:17:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281568229] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:58,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:58,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2024-10-11 03:17:58,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146817405] [2024-10-11 03:17:58,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:58,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:17:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:58,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:17:58,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:17:58,928 INFO L87 Difference]: Start difference. First operand 1613 states and 2166 transitions. Second operand has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 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-10-11 03:18:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:01,130 INFO L93 Difference]: Finished difference Result 3969 states and 5527 transitions. [2024-10-11 03:18:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 03:18:01,131 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 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 277 [2024-10-11 03:18:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:01,146 INFO L225 Difference]: With dead ends: 3969 [2024-10-11 03:18:01,147 INFO L226 Difference]: Without dead ends: 2635 [2024-10-11 03:18:01,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 599 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:18:01,154 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 280 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:01,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 2943 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:18:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-11 03:18:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2399. [2024-10-11 03:18:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 1853 states have (on average 1.3389098758769562) internal successors, (2481), 1905 states have internal predecessors, (2481), 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-10-11 03:18:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3201 transitions. [2024-10-11 03:18:01,493 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3201 transitions. Word has length 277 [2024-10-11 03:18:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:01,494 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 3201 transitions. [2024-10-11 03:18:01,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 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-10-11 03:18:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3201 transitions. [2024-10-11 03:18:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-11 03:18:01,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:01,498 INFO L215 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] [2024-10-11 03:18:01,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 03:18:01,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 03:18:01,700 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:01,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash 29266856, now seen corresponding path program 1 times [2024-10-11 03:18:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293161325] [2024-10-11 03:18:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 03:18:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-11 03:18:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-11 03:18:01,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:01,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293161325] [2024-10-11 03:18:01,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293161325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:01,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396227374] [2024-10-11 03:18:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:01,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:01,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:01,901 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:01,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:18:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 03:18:02,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-10-11 03:18:02,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:18:02,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396227374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:02,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:18:02,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 03:18:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325187766] [2024-10-11 03:18:02,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:02,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:18:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:02,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:18:02,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:18:02,158 INFO L87 Difference]: Start difference. First operand 2399 states and 3201 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-10-11 03:18:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:02,424 INFO L93 Difference]: Finished difference Result 4632 states and 6279 transitions. [2024-10-11 03:18:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:18:02,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 277 [2024-10-11 03:18:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:02,439 INFO L225 Difference]: With dead ends: 4632 [2024-10-11 03:18:02,440 INFO L226 Difference]: Without dead ends: 2335 [2024-10-11 03:18:02,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:18:02,446 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:02,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 693 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:18:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2024-10-11 03:18:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2335. [2024-10-11 03:18:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 1809 states have (on average 1.3217247097844114) internal successors, (2391), 1861 states have internal predecessors, (2391), 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-10-11 03:18:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3075 transitions. [2024-10-11 03:18:02,661 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3075 transitions. Word has length 277 [2024-10-11 03:18:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:02,662 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3075 transitions. [2024-10-11 03:18:02,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-10-11 03:18:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3075 transitions. [2024-10-11 03:18:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-11 03:18:02,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:02,673 INFO L215 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] [2024-10-11 03:18:02,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 03:18:02,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:02,874 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:02,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1524886429, now seen corresponding path program 1 times [2024-10-11 03:18:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:02,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878904891] [2024-10-11 03:18:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:18:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:18:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 03:18:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 03:18:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 03:18:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 03:18:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-11 03:18:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-11 03:18:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 03:18:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-11 03:18:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-11 03:18:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-10-11 03:18:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878904891] [2024-10-11 03:18:03,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878904891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335558232] [2024-10-11 03:18:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:03,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:03,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:03,080 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:03,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 03:18:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 03:18:03,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-10-11 03:18:03,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:18:03,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335558232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:03,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:18:03,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 03:18:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056045276] [2024-10-11 03:18:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:03,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:18:03,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:03,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:18:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:18:03,321 INFO L87 Difference]: Start difference. First operand 2335 states and 3075 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-10-11 03:18:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:03,579 INFO L93 Difference]: Finished difference Result 4414 states and 5920 transitions. [2024-10-11 03:18:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:18:03,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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 280 [2024-10-11 03:18:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:03,596 INFO L225 Difference]: With dead ends: 4414 [2024-10-11 03:18:03,596 INFO L226 Difference]: Without dead ends: 2163 [2024-10-11 03:18:03,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:18:03,603 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 4 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:03,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 721 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:18:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2024-10-11 03:18:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 2163. [2024-10-11 03:18:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1667 states have (on average 1.316136772645471) internal successors, (2194), 1719 states have internal predecessors, (2194), 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-10-11 03:18:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2840 transitions. [2024-10-11 03:18:03,812 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2840 transitions. Word has length 280 [2024-10-11 03:18:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:03,813 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 2840 transitions. [2024-10-11 03:18:03,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-10-11 03:18:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2840 transitions. [2024-10-11 03:18:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-11 03:18:03,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:03,816 INFO L215 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] [2024-10-11 03:18:03,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 03:18:04,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:04,017 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:04,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash 338938814, now seen corresponding path program 1 times [2024-10-11 03:18:04,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:04,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660748064] [2024-10-11 03:18:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:04,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 03:18:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-11 03:18:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 03:18:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-10-11 03:18:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-10-11 03:18:04,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660748064] [2024-10-11 03:18:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660748064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368549403] [2024-10-11 03:18:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:04,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:04,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:04,463 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:04,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 03:18:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:04,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 03:18:04,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-10-11 03:18:04,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:18:04,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368549403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:04,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:18:04,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2024-10-11 03:18:04,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771398901] [2024-10-11 03:18:04,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:04,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:18:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:04,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:18:04,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:18:04,904 INFO L87 Difference]: Start difference. First operand 2163 states and 2840 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 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-10-11 03:18:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:06,040 INFO L93 Difference]: Finished difference Result 7017 states and 9178 transitions. [2024-10-11 03:18:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:18:06,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 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 292 [2024-10-11 03:18:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:06,070 INFO L225 Difference]: With dead ends: 7017 [2024-10-11 03:18:06,070 INFO L226 Difference]: Without dead ends: 5419 [2024-10-11 03:18:06,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-10-11 03:18:06,077 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 625 mSDsluCounter, 2288 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:06,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 2673 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:18:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2024-10-11 03:18:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 5147. [2024-10-11 03:18:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5147 states, 3928 states have (on average 1.3021894093686355) internal successors, (5115), 4056 states have internal predecessors, (5115), 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-10-11 03:18:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 6689 transitions. [2024-10-11 03:18:06,638 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 6689 transitions. Word has length 292 [2024-10-11 03:18:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:06,639 INFO L471 AbstractCegarLoop]: Abstraction has 5147 states and 6689 transitions. [2024-10-11 03:18:06,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 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-10-11 03:18:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 6689 transitions. [2024-10-11 03:18:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-11 03:18:06,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:06,642 INFO L215 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] [2024-10-11 03:18:06,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 03:18:06,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 03:18:06,844 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:06,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1976844183, now seen corresponding path program 1 times [2024-10-11 03:18:06,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:06,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857244325] [2024-10-11 03:18:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:06,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 03:18:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 03:18:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-11 03:18:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-10-11 03:18:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2024-10-11 03:18:07,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:07,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857244325] [2024-10-11 03:18:07,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857244325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:07,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100143133] [2024-10-11 03:18:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:07,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:07,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:07,287 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:07,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 03:18:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:07,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 03:18:07,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-10-11 03:18:07,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:18:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100143133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:07,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:18:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2024-10-11 03:18:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727454556] [2024-10-11 03:18:07,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:07,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:18:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:07,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:18:07,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:18:07,636 INFO L87 Difference]: Start difference. First operand 5147 states and 6689 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 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-10-11 03:18:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:08,609 INFO L93 Difference]: Finished difference Result 10093 states and 13127 transitions. [2024-10-11 03:18:08,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:18:08,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 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 298 [2024-10-11 03:18:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:08,651 INFO L225 Difference]: With dead ends: 10093 [2024-10-11 03:18:08,652 INFO L226 Difference]: Without dead ends: 5419 [2024-10-11 03:18:08,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:18:08,670 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 611 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:08,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 2675 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:18:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2024-10-11 03:18:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 5147. [2024-10-11 03:18:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5147 states, 3928 states have (on average 1.2981160896130346) internal successors, (5099), 4056 states have internal predecessors, (5099), 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-10-11 03:18:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 6673 transitions. [2024-10-11 03:18:09,239 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 6673 transitions. Word has length 298 [2024-10-11 03:18:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:09,239 INFO L471 AbstractCegarLoop]: Abstraction has 5147 states and 6673 transitions. [2024-10-11 03:18:09,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 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-10-11 03:18:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 6673 transitions. [2024-10-11 03:18:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-11 03:18:09,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:09,243 INFO L215 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] [2024-10-11 03:18:09,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 03:18:09,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 03:18:09,444 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:09,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2110857689, now seen corresponding path program 1 times [2024-10-11 03:18:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:09,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845343048] [2024-10-11 03:18:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:09,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 03:18:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 03:18:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-11 03:18:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-10-11 03:18:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-10-11 03:18:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845343048] [2024-10-11 03:18:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845343048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:09,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:09,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:18:09,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53392864] [2024-10-11 03:18:09,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:09,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:18:09,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:18:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:18:09,706 INFO L87 Difference]: Start difference. First operand 5147 states and 6673 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 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-10-11 03:18:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:10,469 INFO L93 Difference]: Finished difference Result 9977 states and 13118 transitions. [2024-10-11 03:18:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:18:10,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 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 298 [2024-10-11 03:18:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:10,500 INFO L225 Difference]: With dead ends: 9977 [2024-10-11 03:18:10,501 INFO L226 Difference]: Without dead ends: 5443 [2024-10-11 03:18:10,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:18:10,518 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 86 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:10,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 791 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:18:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2024-10-11 03:18:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 5439. [2024-10-11 03:18:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 4168 states have (on average 1.3049424184261036) internal successors, (5439), 4296 states have internal predecessors, (5439), 839 states have call successors, (839), 431 states have call predecessors, (839), 431 states have return successors, (839), 719 states have call predecessors, (839), 839 states have call successors, (839) [2024-10-11 03:18:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 7117 transitions. [2024-10-11 03:18:11,048 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 7117 transitions. Word has length 298 [2024-10-11 03:18:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:11,049 INFO L471 AbstractCegarLoop]: Abstraction has 5439 states and 7117 transitions. [2024-10-11 03:18:11,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 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-10-11 03:18:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 7117 transitions. [2024-10-11 03:18:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-11 03:18:11,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:11,052 INFO L215 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] [2024-10-11 03:18:11,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:18:11,053 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:11,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1089789335, now seen corresponding path program 1 times [2024-10-11 03:18:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18549227] [2024-10-11 03:18:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 03:18:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 03:18:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-11 03:18:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-10-11 03:18:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2024-10-11 03:18:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18549227] [2024-10-11 03:18:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18549227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574425914] [2024-10-11 03:18:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:11,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:11,533 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:11,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 03:18:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:11,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 03:18:11,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-10-11 03:18:11,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:18:11,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574425914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:11,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:18:11,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2024-10-11 03:18:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903327988] [2024-10-11 03:18:11,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:11,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:18:11,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:11,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:18:11,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:18:11,900 INFO L87 Difference]: Start difference. First operand 5439 states and 7117 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 03:18:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:12,510 INFO L93 Difference]: Finished difference Result 12495 states and 16343 transitions. [2024-10-11 03:18:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:18:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 298 [2024-10-11 03:18:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:12,543 INFO L225 Difference]: With dead ends: 12495 [2024-10-11 03:18:12,544 INFO L226 Difference]: Without dead ends: 7565 [2024-10-11 03:18:12,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 346 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-10-11 03:18:12,559 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 123 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:12,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1733 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:18:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7565 states. [2024-10-11 03:18:13,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7565 to 6567. [2024-10-11 03:18:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6567 states, 5028 states have (on average 1.3001193317422435) internal successors, (6537), 5184 states have internal predecessors, (6537), 1015 states have call successors, (1015), 523 states have call predecessors, (1015), 523 states have return successors, (1015), 867 states have call predecessors, (1015), 1015 states have call successors, (1015) [2024-10-11 03:18:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 8567 transitions. [2024-10-11 03:18:13,073 INFO L78 Accepts]: Start accepts. Automaton has 6567 states and 8567 transitions. Word has length 298 [2024-10-11 03:18:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:13,073 INFO L471 AbstractCegarLoop]: Abstraction has 6567 states and 8567 transitions. [2024-10-11 03:18:13,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 03:18:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6567 states and 8567 transitions. [2024-10-11 03:18:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-11 03:18:13,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:13,078 INFO L215 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] [2024-10-11 03:18:13,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 03:18:13,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-11 03:18:13,279 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash -821253223, now seen corresponding path program 1 times [2024-10-11 03:18:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436210803] [2024-10-11 03:18:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 03:18:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 03:18:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-11 03:18:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-10-11 03:18:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-10-11 03:18:13,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436210803] [2024-10-11 03:18:13,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436210803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:13,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:18:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057818684] [2024-10-11 03:18:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:18:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:18:13,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:18:13,566 INFO L87 Difference]: Start difference. First operand 6567 states and 8567 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 03:18:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:14,507 INFO L93 Difference]: Finished difference Result 13453 states and 17644 transitions. [2024-10-11 03:18:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:18:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 298 [2024-10-11 03:18:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:14,548 INFO L225 Difference]: With dead ends: 13453 [2024-10-11 03:18:14,548 INFO L226 Difference]: Without dead ends: 7675 [2024-10-11 03:18:14,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 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-10-11 03:18:14,625 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 311 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:14,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 561 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:18:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7675 states. [2024-10-11 03:18:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7675 to 6707. [2024-10-11 03:18:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6707 states, 5135 states have (on average 1.308666017526777) internal successors, (6720), 5291 states have internal predecessors, (6720), 1047 states have call successors, (1047), 524 states have call predecessors, (1047), 524 states have return successors, (1047), 899 states have call predecessors, (1047), 1047 states have call successors, (1047) [2024-10-11 03:18:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 8814 transitions. [2024-10-11 03:18:15,443 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 8814 transitions. Word has length 298 [2024-10-11 03:18:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:15,444 INFO L471 AbstractCegarLoop]: Abstraction has 6707 states and 8814 transitions. [2024-10-11 03:18:15,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 03:18:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 8814 transitions. [2024-10-11 03:18:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-10-11 03:18:15,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:15,452 INFO L215 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, 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] [2024-10-11 03:18:15,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:18:15,452 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:15,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:15,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1012381897, now seen corresponding path program 1 times [2024-10-11 03:18:15,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:15,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082448467] [2024-10-11 03:18:15,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:15,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 03:18:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 03:18:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 03:18:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 03:18:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-11 03:18:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2024-10-11 03:18:15,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:15,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082448467] [2024-10-11 03:18:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082448467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:15,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:18:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341964806] [2024-10-11 03:18:15,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:18:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:15,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:18:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:18:15,687 INFO L87 Difference]: Start difference. First operand 6707 states and 8814 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 03:18:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:16,748 INFO L93 Difference]: Finished difference Result 11731 states and 15493 transitions. [2024-10-11 03:18:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:18:16,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 305 [2024-10-11 03:18:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:16,782 INFO L225 Difference]: With dead ends: 11731 [2024-10-11 03:18:16,782 INFO L226 Difference]: Without dead ends: 5817 [2024-10-11 03:18:16,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 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-10-11 03:18:16,799 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 478 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:16,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 787 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:18:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5817 states. [2024-10-11 03:18:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5817 to 5789. [2024-10-11 03:18:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 4437 states have (on average 1.2943430245661482) internal successors, (5743), 4569 states have internal predecessors, (5743), 903 states have call successors, (903), 448 states have call predecessors, (903), 448 states have return successors, (903), 771 states have call predecessors, (903), 903 states have call successors, (903) [2024-10-11 03:18:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7549 transitions. [2024-10-11 03:18:17,325 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7549 transitions. Word has length 305 [2024-10-11 03:18:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:17,325 INFO L471 AbstractCegarLoop]: Abstraction has 5789 states and 7549 transitions. [2024-10-11 03:18:17,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 03:18:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7549 transitions. [2024-10-11 03:18:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-11 03:18:17,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:17,337 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:18:17,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:18:17,338 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:17,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 962094426, now seen corresponding path program 1 times [2024-10-11 03:18:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:17,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614963644] [2024-10-11 03:18:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 03:18:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 03:18:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 03:18:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 03:18:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-11 03:18:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-10-11 03:18:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 03:18:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 03:18:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-10-11 03:18:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-10-11 03:18:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-10-11 03:18:18,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:18,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614963644] [2024-10-11 03:18:18,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614963644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:18,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:18,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:18:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762011286] [2024-10-11 03:18:18,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:18,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:18:18,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:18,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:18:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:18:18,462 INFO L87 Difference]: Start difference. First operand 5789 states and 7549 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 03:18:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:19,816 INFO L93 Difference]: Finished difference Result 13217 states and 17119 transitions. [2024-10-11 03:18:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:18:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) Word has length 348 [2024-10-11 03:18:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:19,853 INFO L225 Difference]: With dead ends: 13217 [2024-10-11 03:18:19,853 INFO L226 Difference]: Without dead ends: 8221 [2024-10-11 03:18:19,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:18:19,863 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 136 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:19,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1184 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:18:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8221 states. [2024-10-11 03:18:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8221 to 7625. [2024-10-11 03:18:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7625 states, 5825 states have (on average 1.2791416309012875) internal successors, (7451), 5989 states have internal predecessors, (7451), 1143 states have call successors, (1143), 596 states have call predecessors, (1143), 656 states have return successors, (1231), 1039 states have call predecessors, (1231), 1143 states have call successors, (1231) [2024-10-11 03:18:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7625 states to 7625 states and 9825 transitions. [2024-10-11 03:18:20,600 INFO L78 Accepts]: Start accepts. Automaton has 7625 states and 9825 transitions. Word has length 348 [2024-10-11 03:18:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:20,600 INFO L471 AbstractCegarLoop]: Abstraction has 7625 states and 9825 transitions. [2024-10-11 03:18:20,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 03:18:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 7625 states and 9825 transitions. [2024-10-11 03:18:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-11 03:18:20,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:20,616 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 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] [2024-10-11 03:18:20,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 03:18:20,617 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:20,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash 765580921, now seen corresponding path program 1 times [2024-10-11 03:18:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157709258] [2024-10-11 03:18:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 03:18:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 03:18:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 03:18:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 03:18:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-11 03:18:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-10-11 03:18:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 03:18:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 03:18:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-10-11 03:18:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-10-11 03:18:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2024-10-11 03:18:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:20,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157709258] [2024-10-11 03:18:20,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157709258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:20,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:20,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:18:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501671816] [2024-10-11 03:18:20,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:20,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:18:20,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:20,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:18:20,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:18:20,867 INFO L87 Difference]: Start difference. First operand 7625 states and 9825 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 03:18:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:21,993 INFO L93 Difference]: Finished difference Result 15388 states and 19794 transitions. [2024-10-11 03:18:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:18:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 348 [2024-10-11 03:18:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:22,039 INFO L225 Difference]: With dead ends: 15388 [2024-10-11 03:18:22,040 INFO L226 Difference]: Without dead ends: 7385 [2024-10-11 03:18:22,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 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-10-11 03:18:22,063 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 100 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:22,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 606 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:18:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7385 states. [2024-10-11 03:18:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7385 to 7385. [2024-10-11 03:18:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7385 states, 5645 states have (on average 1.2428697962798938) internal successors, (7016), 5809 states have internal predecessors, (7016), 1143 states have call successors, (1143), 596 states have call predecessors, (1143), 596 states have return successors, (1143), 979 states have call predecessors, (1143), 1143 states have call successors, (1143) [2024-10-11 03:18:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 9302 transitions. [2024-10-11 03:18:22,738 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 9302 transitions. Word has length 348 [2024-10-11 03:18:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:22,739 INFO L471 AbstractCegarLoop]: Abstraction has 7385 states and 9302 transitions. [2024-10-11 03:18:22,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 03:18:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 9302 transitions. [2024-10-11 03:18:22,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-11 03:18:22,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:22,754 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:18:22,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 03:18:22,754 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:22,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1717534433, now seen corresponding path program 1 times [2024-10-11 03:18:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802825905] [2024-10-11 03:18:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:22,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 03:18:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 03:18:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 03:18:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 03:18:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-11 03:18:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-10-11 03:18:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 03:18:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 03:18:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-10-11 03:18:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-10-11 03:18:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-10-11 03:18:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 29 proven. 70 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2024-10-11 03:18:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802825905] [2024-10-11 03:18:24,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802825905] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877775420] [2024-10-11 03:18:24,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:24,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:24,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:24,291 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:24,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 03:18:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:24,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 03:18:24,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 285 proven. 78 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-10-11 03:18:24,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 34 proven. 72 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-10-11 03:18:25,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877775420] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:25,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:25,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 40 [2024-10-11 03:18:25,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876485828] [2024-10-11 03:18:25,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:25,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 03:18:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 03:18:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:18:25,844 INFO L87 Difference]: Start difference. First operand 7385 states and 9302 transitions. Second operand has 40 states, 38 states have (on average 6.7631578947368425) internal successors, (257), 33 states have internal predecessors, (257), 9 states have call successors, (56), 9 states have call predecessors, (56), 20 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2024-10-11 03:18:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:32,837 INFO L93 Difference]: Finished difference Result 30158 states and 39073 transitions. [2024-10-11 03:18:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-10-11 03:18:32,838 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 6.7631578947368425) internal successors, (257), 33 states have internal predecessors, (257), 9 states have call successors, (56), 9 states have call predecessors, (56), 20 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) Word has length 358 [2024-10-11 03:18:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:32,979 INFO L225 Difference]: With dead ends: 30158 [2024-10-11 03:18:32,980 INFO L226 Difference]: Without dead ends: 23638 [2024-10-11 03:18:33,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2562 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1709, Invalid=8797, Unknown=0, NotChecked=0, Total=10506 [2024-10-11 03:18:33,017 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 2348 mSDsluCounter, 6931 mSDsCounter, 0 mSdLazyCounter, 4931 mSolverCounterSat, 948 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2352 SdHoareTripleChecker+Valid, 7466 SdHoareTripleChecker+Invalid, 5879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 948 IncrementalHoareTripleChecker+Valid, 4931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:33,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2352 Valid, 7466 Invalid, 5879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [948 Valid, 4931 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 03:18:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23638 states. [2024-10-11 03:18:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23638 to 14723. [2024-10-11 03:18:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14723 states, 11244 states have (on average 1.2358591248665955) internal successors, (13896), 11500 states have internal predecessors, (13896), 2275 states have call successors, (2275), 1203 states have call predecessors, (2275), 1203 states have return successors, (2275), 2019 states have call predecessors, (2275), 2275 states have call successors, (2275) [2024-10-11 03:18:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14723 states to 14723 states and 18446 transitions. [2024-10-11 03:18:35,081 INFO L78 Accepts]: Start accepts. Automaton has 14723 states and 18446 transitions. Word has length 358 [2024-10-11 03:18:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:35,082 INFO L471 AbstractCegarLoop]: Abstraction has 14723 states and 18446 transitions. [2024-10-11 03:18:35,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 6.7631578947368425) internal successors, (257), 33 states have internal predecessors, (257), 9 states have call successors, (56), 9 states have call predecessors, (56), 20 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2024-10-11 03:18:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 14723 states and 18446 transitions. [2024-10-11 03:18:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-11 03:18:35,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:35,108 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:18:35,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 03:18:35,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-11 03:18:35,309 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:35,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash 153360191, now seen corresponding path program 1 times [2024-10-11 03:18:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:35,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742747924] [2024-10-11 03:18:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:35,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:18:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:18:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:18:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 03:18:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:18:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:18:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:18:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:18:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:18:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 03:18:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:18:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:18:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 03:18:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 03:18:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 03:18:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 03:18:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 03:18:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 03:18:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 03:18:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 03:18:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 03:18:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 03:18:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-11 03:18:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-11 03:18:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-10-11 03:18:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 03:18:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-11 03:18:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-10-11 03:18:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-10-11 03:18:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-10-11 03:18:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 48 proven. 54 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2024-10-11 03:18:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742747924] [2024-10-11 03:18:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742747924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109461977] [2024-10-11 03:18:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:36,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:36,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:36,694 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:36,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 03:18:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:36,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 03:18:36,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 266 proven. 95 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-10-11 03:18:37,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-10-11 03:18:38,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109461977] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:38,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 41 [2024-10-11 03:18:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231015027] [2024-10-11 03:18:38,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:38,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 03:18:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:38,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 03:18:38,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1449, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 03:18:38,132 INFO L87 Difference]: Start difference. First operand 14723 states and 18446 transitions. Second operand has 41 states, 39 states have (on average 6.948717948717949) internal successors, (271), 34 states have internal predecessors, (271), 9 states have call successors, (59), 9 states have call predecessors, (59), 19 states have return successors, (56), 12 states have call predecessors, (56), 8 states have call successors, (56) [2024-10-11 03:18:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:46,992 INFO L93 Difference]: Finished difference Result 49415 states and 64366 transitions. [2024-10-11 03:18:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 03:18:46,993 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 6.948717948717949) internal successors, (271), 34 states have internal predecessors, (271), 9 states have call successors, (59), 9 states have call predecessors, (59), 19 states have return successors, (56), 12 states have call predecessors, (56), 8 states have call successors, (56) Word has length 358 [2024-10-11 03:18:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:47,179 INFO L225 Difference]: With dead ends: 49415 [2024-10-11 03:18:47,180 INFO L226 Difference]: Without dead ends: 35873 [2024-10-11 03:18:47,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2729 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1813, Invalid=9107, Unknown=0, NotChecked=0, Total=10920 [2024-10-11 03:18:47,238 INFO L432 NwaCegarLoop]: 651 mSDtfsCounter, 2362 mSDsluCounter, 8547 mSDsCounter, 0 mSdLazyCounter, 5471 mSolverCounterSat, 881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2366 SdHoareTripleChecker+Valid, 9198 SdHoareTripleChecker+Invalid, 6352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 5471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:47,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2366 Valid, 9198 Invalid, 6352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 5471 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]