./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_ActiveStandby.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_ActiveStandby.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 5d72e5e7abaa750c1c0009f2e3addca35915e1b949637f5a49ed633aadc3fe53 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:17:09,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:17:09,123 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:09,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:17:09,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:17:09,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:17:09,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:17:09,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:17:09,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:17:09,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:17:09,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:17:09,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:17:09,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:17:09,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:17:09,156 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:17:09,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:17:09,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:17:09,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:17:09,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:17:09,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:17:09,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:17:09,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:17:09,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:17:09,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:17:09,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:17:09,159 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:17:09,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:17:09,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:17:09,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:17:09,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:17:09,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:17:09,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:17:09,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:17:09,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:17:09,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:17:09,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:17:09,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:17:09,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:17:09,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:17:09,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:17:09,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:17:09,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:17:09,163 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 -> 5d72e5e7abaa750c1c0009f2e3addca35915e1b949637f5a49ed633aadc3fe53 [2024-10-11 03:17:09,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:17:09,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:17:09,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:17:09,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:17:09,393 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:17:09,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2024-10-11 03:17:10,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:17:10,845 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:17:10,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2024-10-11 03:17:10,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a298035f/69752f38a56e4b6cbf9227c8b0b8582f/FLAG58cca15b1 [2024-10-11 03:17:10,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a298035f/69752f38a56e4b6cbf9227c8b0b8582f [2024-10-11 03:17:10,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:17:10,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:17:10,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:17:10,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:17:10,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:17:10,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:17:10" (1/1) ... [2024-10-11 03:17:10,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e19c31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:10, skipping insertion in model container [2024-10-11 03:17:10,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:17:10" (1/1) ... [2024-10-11 03:17:10,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:17:11,127 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_ActiveStandby.ufo.UNBOUNDED.pals.c[14680,14693] [2024-10-11 03:17:11,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:17:11,161 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:17:11,247 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_ActiveStandby.ufo.UNBOUNDED.pals.c[14680,14693] [2024-10-11 03:17:11,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:17:11,266 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:17:11,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:11 WrapperNode [2024-10-11 03:17:11,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:17:11,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:17:11,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:17:11,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:17:11,274 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:11" (1/1) ... [2024-10-11 03:17:11,285 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:11" (1/1) ... [2024-10-11 03:17:11,313 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 507 [2024-10-11 03:17:11,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:17:11,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:17:11,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:17:11,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:17:11,327 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:11" (1/1) ... [2024-10-11 03:17:11,327 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:11" (1/1) ... [2024-10-11 03:17:11,330 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:11" (1/1) ... [2024-10-11 03:17:11,348 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:11,348 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:11" (1/1) ... [2024-10-11 03:17:11,348 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:11" (1/1) ... [2024-10-11 03:17:11,356 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:11" (1/1) ... [2024-10-11 03:17:11,361 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:11" (1/1) ... [2024-10-11 03:17:11,364 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:11" (1/1) ... [2024-10-11 03:17:11,365 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:11" (1/1) ... [2024-10-11 03:17:11,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:17:11,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:17:11,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:17:11,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:17:11,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:11" (1/1) ... [2024-10-11 03:17:11,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:17:11,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:11,406 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:11,408 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:11,446 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-11 03:17:11,447 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-11 03:17:11,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:17:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-11 03:17:11,448 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-11 03:17:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-11 03:17:11,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-11 03:17:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-11 03:17:11,449 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-11 03:17:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 03:17:11,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 03:17:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:17:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-11 03:17:11,450 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-11 03:17:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:17:11,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:17:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-11 03:17:11,450 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-11 03:17:11,551 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:17:11,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:17:12,000 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-11 03:17:12,000 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:17:12,046 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:17:12,047 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:17:12,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:17:12 BoogieIcfgContainer [2024-10-11 03:17:12,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:17:12,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:17:12,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:17:12,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:17:12,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:17:10" (1/3) ... [2024-10-11 03:17:12,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544a8674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:17:12, skipping insertion in model container [2024-10-11 03:17:12,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:11" (2/3) ... [2024-10-11 03:17:12,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544a8674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:17:12, skipping insertion in model container [2024-10-11 03:17:12,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:17:12" (3/3) ... [2024-10-11 03:17:12,055 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2024-10-11 03:17:12,068 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:17:12,068 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:17:12,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:17:12,136 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;@7096c968, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:17:12,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:17:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:17:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:17:12,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:12,150 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] [2024-10-11 03:17:12,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:12,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash 975176766, now seen corresponding path program 1 times [2024-10-11 03:17:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:12,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715777765] [2024-10-11 03:17:12,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:12,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,388 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:12,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:12,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715777765] [2024-10-11 03:17:12,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715777765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:12,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:12,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:17:12,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453286935] [2024-10-11 03:17:12,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:12,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:17:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:12,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:17:12,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:17:12,424 INFO L87 Difference]: Start difference. First operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:12,506 INFO L93 Difference]: Finished difference Result 323 states and 540 transitions. [2024-10-11 03:17:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:17:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 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:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:12,519 INFO L225 Difference]: With dead ends: 323 [2024-10-11 03:17:12,519 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 03:17:12,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:17:12,530 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:12,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 03:17:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-11 03:17:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.573643410852713) internal successors, (203), 130 states have internal predecessors, (203), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:17:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 265 transitions. [2024-10-11 03:17:12,585 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 265 transitions. Word has length 23 [2024-10-11 03:17:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:12,585 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 265 transitions. [2024-10-11 03:17:12,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 265 transitions. [2024-10-11 03:17:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:17:12,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:12,587 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] [2024-10-11 03:17:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:17:12,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:12,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1018967940, now seen corresponding path program 1 times [2024-10-11 03:17:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940170959] [2024-10-11 03:17:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,805 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:12,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:12,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940170959] [2024-10-11 03:17:12,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940170959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:12,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:12,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:17:12,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385770765] [2024-10-11 03:17:12,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:12,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:17:12,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:12,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:17:12,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:17:12,809 INFO L87 Difference]: Start difference. First operand 168 states and 265 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:12,907 INFO L93 Difference]: Finished difference Result 323 states and 505 transitions. [2024-10-11 03:17:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:17:12,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 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:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:12,910 INFO L225 Difference]: With dead ends: 323 [2024-10-11 03:17:12,910 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 03:17:12,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:12,912 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:12,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1260 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 03:17:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-11 03:17:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 130 states have internal predecessors, (191), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:17:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2024-10-11 03:17:12,929 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 23 [2024-10-11 03:17:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:12,930 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2024-10-11 03:17:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2024-10-11 03:17:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:17:12,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:12,931 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:12,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:17:12,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:12,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 26280683, now seen corresponding path program 1 times [2024-10-11 03:17:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:12,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91102511] [2024-10-11 03:17:12,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,156 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:13,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91102511] [2024-10-11 03:17:13,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91102511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:13,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:13,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602185910] [2024-10-11 03:17:13,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:13,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:13,162 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:13,249 INFO L93 Difference]: Finished difference Result 324 states and 497 transitions. [2024-10-11 03:17:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:13,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-10-11 03:17:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:13,252 INFO L225 Difference]: With dead ends: 324 [2024-10-11 03:17:13,252 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 03:17:13,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:13,254 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 3 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:13,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 716 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 03:17:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-10-11 03:17:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.4696969696969697) internal successors, (194), 133 states have internal predecessors, (194), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:17:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2024-10-11 03:17:13,275 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 34 [2024-10-11 03:17:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:13,275 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2024-10-11 03:17:13,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2024-10-11 03:17:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:17:13,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:13,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:13,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:17:13,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:13,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:13,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1285077620, now seen corresponding path program 1 times [2024-10-11 03:17:13,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:13,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127134248] [2024-10-11 03:17:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:13,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127134248] [2024-10-11 03:17:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127134248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256269873] [2024-10-11 03:17:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:13,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:13,346 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:13,404 INFO L93 Difference]: Finished difference Result 473 states and 714 transitions. [2024-10-11 03:17:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:13,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2024-10-11 03:17:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:13,408 INFO L225 Difference]: With dead ends: 473 [2024-10-11 03:17:13,408 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 03:17:13,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:13,410 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 209 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 495 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:13,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 495 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:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 03:17:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2024-10-11 03:17:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 237 states have (on average 1.4852320675105486) internal successors, (352), 239 states have internal predecessors, (352), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 03:17:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 472 transitions. [2024-10-11 03:17:13,440 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 472 transitions. Word has length 48 [2024-10-11 03:17:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:13,441 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 472 transitions. [2024-10-11 03:17:13,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 472 transitions. [2024-10-11 03:17:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:17:13,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:13,443 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:13,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:17:13,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:13,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:13,444 INFO L85 PathProgramCache]: Analyzing trace with hash -271052700, now seen corresponding path program 1 times [2024-10-11 03:17:13,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:13,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004374504] [2024-10-11 03:17:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:13,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004374504] [2024-10-11 03:17:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004374504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:13,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:13,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128038221] [2024-10-11 03:17:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:13,508 INFO L87 Difference]: Start difference. First operand 314 states and 472 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:13,574 INFO L93 Difference]: Finished difference Result 886 states and 1342 transitions. [2024-10-11 03:17:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:13,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-11 03:17:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:13,581 INFO L225 Difference]: With dead ends: 886 [2024-10-11 03:17:13,581 INFO L226 Difference]: Without dead ends: 588 [2024-10-11 03:17:13,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:13,583 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 210 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:13,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 515 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-11 03:17:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 582. [2024-10-11 03:17:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 433 states have (on average 1.4942263279445727) internal successors, (647), 437 states have internal predecessors, (647), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-11 03:17:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 881 transitions. [2024-10-11 03:17:13,629 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 881 transitions. Word has length 49 [2024-10-11 03:17:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:13,631 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 881 transitions. [2024-10-11 03:17:13,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 881 transitions. [2024-10-11 03:17:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:17:13,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:13,634 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:13,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:17:13,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:13,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1550916378, now seen corresponding path program 1 times [2024-10-11 03:17:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:13,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156602716] [2024-10-11 03:17:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:13,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156602716] [2024-10-11 03:17:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156602716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:13,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265683094] [2024-10-11 03:17:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:13,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:13,768 INFO L87 Difference]: Start difference. First operand 582 states and 881 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:13,933 INFO L93 Difference]: Finished difference Result 1237 states and 1874 transitions. [2024-10-11 03:17:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:13,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-11 03:17:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:13,938 INFO L225 Difference]: With dead ends: 1237 [2024-10-11 03:17:13,939 INFO L226 Difference]: Without dead ends: 671 [2024-10-11 03:17:13,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:13,943 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 347 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:13,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-11 03:17:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 663. [2024-10-11 03:17:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 501 states have (on average 1.4810379241516967) internal successors, (742), 504 states have internal predecessors, (742), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 990 transitions. [2024-10-11 03:17:14,001 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 990 transitions. Word has length 49 [2024-10-11 03:17:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:14,003 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 990 transitions. [2024-10-11 03:17:14,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 990 transitions. [2024-10-11 03:17:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:17:14,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:14,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:14,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:17:14,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:14,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1743107091, now seen corresponding path program 1 times [2024-10-11 03:17:14,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:14,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524921714] [2024-10-11 03:17:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:17:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:14,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524921714] [2024-10-11 03:17:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524921714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:14,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:14,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853615468] [2024-10-11 03:17:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:14,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:14,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:14,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:14,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:14,167 INFO L87 Difference]: Start difference. First operand 663 states and 990 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:14,327 INFO L93 Difference]: Finished difference Result 1241 states and 1874 transitions. [2024-10-11 03:17:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:14,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-10-11 03:17:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:14,332 INFO L225 Difference]: With dead ends: 1241 [2024-10-11 03:17:14,332 INFO L226 Difference]: Without dead ends: 675 [2024-10-11 03:17:14,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:14,335 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 347 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:14,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-11 03:17:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 671. [2024-10-11 03:17:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4734774066797642) internal successors, (750), 512 states have internal predecessors, (750), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 998 transitions. [2024-10-11 03:17:14,385 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 998 transitions. Word has length 50 [2024-10-11 03:17:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:14,386 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 998 transitions. [2024-10-11 03:17:14,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 998 transitions. [2024-10-11 03:17:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:17:14,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:14,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:14,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:17:14,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:14,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1020972895, now seen corresponding path program 1 times [2024-10-11 03:17:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953658509] [2024-10-11 03:17:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:17:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:14,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:14,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953658509] [2024-10-11 03:17:14,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953658509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:14,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:14,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:14,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795046952] [2024-10-11 03:17:14,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:14,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:14,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:14,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:14,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:14,535 INFO L87 Difference]: Start difference. First operand 671 states and 998 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:14,664 INFO L93 Difference]: Finished difference Result 1237 states and 1862 transitions. [2024-10-11 03:17:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:14,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2024-10-11 03:17:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:14,673 INFO L225 Difference]: With dead ends: 1237 [2024-10-11 03:17:14,673 INFO L226 Difference]: Without dead ends: 671 [2024-10-11 03:17:14,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:14,675 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 58 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:14,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 640 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-11 03:17:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2024-10-11 03:17:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4656188605108056) internal successors, (746), 512 states have internal predecessors, (746), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 994 transitions. [2024-10-11 03:17:14,728 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 994 transitions. Word has length 52 [2024-10-11 03:17:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:14,728 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 994 transitions. [2024-10-11 03:17:14,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 994 transitions. [2024-10-11 03:17:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:17:14,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:14,729 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:14,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:17:14,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash 70077876, now seen corresponding path program 1 times [2024-10-11 03:17:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501544085] [2024-10-11 03:17:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:14,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:14,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501544085] [2024-10-11 03:17:14,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501544085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:14,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597804877] [2024-10-11 03:17:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:14,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:14,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:14,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:14,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:14,877 INFO L87 Difference]: Start difference. First operand 671 states and 994 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 03:17:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:14,939 INFO L93 Difference]: Finished difference Result 1257 states and 1886 transitions. [2024-10-11 03:17:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-10-11 03:17:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:14,943 INFO L225 Difference]: With dead ends: 1257 [2024-10-11 03:17:14,943 INFO L226 Difference]: Without dead ends: 691 [2024-10-11 03:17:14,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:14,945 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 4 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:14,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 728 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-11 03:17:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-10-11 03:17:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 525 states have (on average 1.4514285714285715) internal successors, (762), 528 states have internal predecessors, (762), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1010 transitions. [2024-10-11 03:17:14,983 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1010 transitions. Word has length 53 [2024-10-11 03:17:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:14,983 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1010 transitions. [2024-10-11 03:17:14,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 03:17:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1010 transitions. [2024-10-11 03:17:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:17:14,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:14,984 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:17:14,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:14,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2022849498, now seen corresponding path program 1 times [2024-10-11 03:17:14,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497035014] [2024-10-11 03:17:14,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:15,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497035014] [2024-10-11 03:17:15,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497035014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:15,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:15,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784715019] [2024-10-11 03:17:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:15,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:15,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:15,138 INFO L87 Difference]: Start difference. First operand 691 states and 1010 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 03:17:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:15,216 INFO L93 Difference]: Finished difference Result 1297 states and 1930 transitions. [2024-10-11 03:17:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:15,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2024-10-11 03:17:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:15,220 INFO L225 Difference]: With dead ends: 1297 [2024-10-11 03:17:15,221 INFO L226 Difference]: Without dead ends: 711 [2024-10-11 03:17:15,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:15,223 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:15,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-11 03:17:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2024-10-11 03:17:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 541 states have (on average 1.4380776340110906) internal successors, (778), 544 states have internal predecessors, (778), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1026 transitions. [2024-10-11 03:17:15,260 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1026 transitions. Word has length 61 [2024-10-11 03:17:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:15,261 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1026 transitions. [2024-10-11 03:17:15,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 03:17:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1026 transitions. [2024-10-11 03:17:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:17:15,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:15,263 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:17:15,263 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:15,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1319245148, now seen corresponding path program 1 times [2024-10-11 03:17:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:15,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132393683] [2024-10-11 03:17:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:15,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:15,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:15,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132393683] [2024-10-11 03:17:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132393683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245307454] [2024-10-11 03:17:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:15,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:15,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:15,410 INFO L87 Difference]: Start difference. First operand 711 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:17:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:15,505 INFO L93 Difference]: Finished difference Result 1333 states and 1946 transitions. [2024-10-11 03:17:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:15,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-11 03:17:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:15,510 INFO L225 Difference]: With dead ends: 1333 [2024-10-11 03:17:15,510 INFO L226 Difference]: Without dead ends: 727 [2024-10-11 03:17:15,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:15,513 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:15,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 724 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-11 03:17:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2024-10-11 03:17:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 553 states have (on average 1.4285714285714286) internal successors, (790), 556 states have internal predecessors, (790), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1038 transitions. [2024-10-11 03:17:15,549 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1038 transitions. Word has length 69 [2024-10-11 03:17:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:15,549 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1038 transitions. [2024-10-11 03:17:15,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:17:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1038 transitions. [2024-10-11 03:17:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:17:15,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:15,551 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:17:15,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:15,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1077214155, now seen corresponding path program 1 times [2024-10-11 03:17:15,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:15,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909639913] [2024-10-11 03:17:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:15,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909639913] [2024-10-11 03:17:15,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909639913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:15,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:15,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:15,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308062883] [2024-10-11 03:17:15,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:15,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:15,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:15,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:15,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:15,705 INFO L87 Difference]: Start difference. First operand 727 states and 1038 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:17:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:15,779 INFO L93 Difference]: Finished difference Result 1369 states and 1986 transitions. [2024-10-11 03:17:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-11 03:17:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:15,784 INFO L225 Difference]: With dead ends: 1369 [2024-10-11 03:17:15,785 INFO L226 Difference]: Without dead ends: 747 [2024-10-11 03:17:15,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:15,787 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:15,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-11 03:17:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2024-10-11 03:17:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 569 states have (on average 1.4165202108963093) internal successors, (806), 572 states have internal predecessors, (806), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1054 transitions. [2024-10-11 03:17:15,830 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1054 transitions. Word has length 69 [2024-10-11 03:17:15,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:15,834 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1054 transitions. [2024-10-11 03:17:15,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:17:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1054 transitions. [2024-10-11 03:17:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:17:15,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:15,836 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:17:15,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:17:15,836 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:15,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 371503403, now seen corresponding path program 1 times [2024-10-11 03:17:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:15,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231326016] [2024-10-11 03:17:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:16,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:16,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231326016] [2024-10-11 03:17:16,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231326016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:16,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:16,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:16,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138271236] [2024-10-11 03:17:16,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:16,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:16,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:16,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:16,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:16,029 INFO L87 Difference]: Start difference. First operand 747 states and 1054 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:17:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:16,092 INFO L93 Difference]: Finished difference Result 1413 states and 2014 transitions. [2024-10-11 03:17:16,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:16,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2024-10-11 03:17:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:16,096 INFO L225 Difference]: With dead ends: 1413 [2024-10-11 03:17:16,097 INFO L226 Difference]: Without dead ends: 771 [2024-10-11 03:17:16,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:16,098 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 5 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:16,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 726 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-11 03:17:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2024-10-11 03:17:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 589 states have (on average 1.4023769100169778) internal successors, (826), 592 states have internal predecessors, (826), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1074 transitions. [2024-10-11 03:17:16,129 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1074 transitions. Word has length 77 [2024-10-11 03:17:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:16,129 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1074 transitions. [2024-10-11 03:17:16,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:17:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1074 transitions. [2024-10-11 03:17:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:17:16,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:16,131 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:17:16,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:17:16,131 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:16,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1261624674, now seen corresponding path program 1 times [2024-10-11 03:17:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:16,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943008618] [2024-10-11 03:17:16,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:16,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:17:16,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:16,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943008618] [2024-10-11 03:17:16,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943008618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:16,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:16,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484862727] [2024-10-11 03:17:16,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:16,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:16,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:16,546 INFO L87 Difference]: Start difference. First operand 771 states and 1074 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:17:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:16,798 INFO L93 Difference]: Finished difference Result 1995 states and 2765 transitions. [2024-10-11 03:17:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:16,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-11 03:17:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:16,804 INFO L225 Difference]: With dead ends: 1995 [2024-10-11 03:17:16,805 INFO L226 Difference]: Without dead ends: 1329 [2024-10-11 03:17:16,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:16,807 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 193 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:16,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1404 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2024-10-11 03:17:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1047. [2024-10-11 03:17:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 792 states have (on average 1.3888888888888888) internal successors, (1100), 797 states have internal predecessors, (1100), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-11 03:17:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1444 transitions. [2024-10-11 03:17:16,870 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1444 transitions. Word has length 80 [2024-10-11 03:17:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:16,870 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1444 transitions. [2024-10-11 03:17:16,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:17:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1444 transitions. [2024-10-11 03:17:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 03:17:16,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:16,872 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:16,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:17:16,872 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:16,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 203336820, now seen corresponding path program 1 times [2024-10-11 03:17:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:16,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176078061] [2024-10-11 03:17:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:17:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:17:16,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:16,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176078061] [2024-10-11 03:17:16,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176078061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:16,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:16,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283146636] [2024-10-11 03:17:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:16,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:16,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:16,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:16,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:16,997 INFO L87 Difference]: Start difference. First operand 1047 states and 1444 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 03:17:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:17,083 INFO L93 Difference]: Finished difference Result 1953 states and 2714 transitions. [2024-10-11 03:17:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-11 03:17:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:17,089 INFO L225 Difference]: With dead ends: 1953 [2024-10-11 03:17:17,090 INFO L226 Difference]: Without dead ends: 1071 [2024-10-11 03:17:17,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:17,093 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:17,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 724 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-11 03:17:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-11 03:17:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 810 states have (on average 1.3802469135802469) internal successors, (1118), 815 states have internal predecessors, (1118), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-11 03:17:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1462 transitions. [2024-10-11 03:17:17,166 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1462 transitions. Word has length 84 [2024-10-11 03:17:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:17,166 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1462 transitions. [2024-10-11 03:17:17,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 03:17:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1462 transitions. [2024-10-11 03:17:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 03:17:17,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:17,168 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:17,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:17:17,168 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:17,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1117244196, now seen corresponding path program 1 times [2024-10-11 03:17:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:17,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317475688] [2024-10-11 03:17:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 03:17:17,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:17,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317475688] [2024-10-11 03:17:17,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317475688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:17,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:17,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:17,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783606379] [2024-10-11 03:17:17,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:17,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:17,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:17,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:17,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:17,373 INFO L87 Difference]: Start difference. First operand 1071 states and 1462 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:17,574 INFO L93 Difference]: Finished difference Result 1485 states and 2136 transitions. [2024-10-11 03:17:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2024-10-11 03:17:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:17,581 INFO L225 Difference]: With dead ends: 1485 [2024-10-11 03:17:17,582 INFO L226 Difference]: Without dead ends: 1483 [2024-10-11 03:17:17,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:17:17,583 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 259 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:17,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 2482 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-10-11 03:17:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1079. [2024-10-11 03:17:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 814 states have (on average 1.3783783783783783) internal successors, (1122), 821 states have internal predecessors, (1122), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-11 03:17:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1470 transitions. [2024-10-11 03:17:17,646 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1470 transitions. Word has length 83 [2024-10-11 03:17:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:17,647 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1470 transitions. [2024-10-11 03:17:17,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1470 transitions. [2024-10-11 03:17:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:17:17,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:17,648 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:17,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:17:17,648 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:17,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1786856787, now seen corresponding path program 1 times [2024-10-11 03:17:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:17,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049961277] [2024-10-11 03:17:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:17,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:17:17,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:17,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049961277] [2024-10-11 03:17:17,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049961277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:17,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:17,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:17,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607453338] [2024-10-11 03:17:17,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:17,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:17,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:17,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:17,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:17,781 INFO L87 Difference]: Start difference. First operand 1079 states and 1470 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:17,984 INFO L93 Difference]: Finished difference Result 1945 states and 2661 transitions. [2024-10-11 03:17:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:17,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2024-10-11 03:17:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:17,990 INFO L225 Difference]: With dead ends: 1945 [2024-10-11 03:17:17,991 INFO L226 Difference]: Without dead ends: 1113 [2024-10-11 03:17:17,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:17:17,993 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 244 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:17,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1421 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-10-11 03:17:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1071. [2024-10-11 03:17:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 817 states have (on average 1.3733170134638923) internal successors, (1122), 829 states have internal predecessors, (1122), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-10-11 03:17:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1446 transitions. [2024-10-11 03:17:18,079 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1446 transitions. Word has length 86 [2024-10-11 03:17:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:18,079 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1446 transitions. [2024-10-11 03:17:18,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1446 transitions. [2024-10-11 03:17:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:17:18,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:18,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:18,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:17:18,081 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:18,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 116448996, now seen corresponding path program 1 times [2024-10-11 03:17:18,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507304670] [2024-10-11 03:17:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:17:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 03:17:18,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:18,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507304670] [2024-10-11 03:17:18,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507304670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:18,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:18,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:18,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545806679] [2024-10-11 03:17:18,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:18,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:18,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:18,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:18,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:18,475 INFO L87 Difference]: Start difference. First operand 1071 states and 1446 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:17:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:18,679 INFO L93 Difference]: Finished difference Result 1911 states and 2591 transitions. [2024-10-11 03:17:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:18,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2024-10-11 03:17:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:18,685 INFO L225 Difference]: With dead ends: 1911 [2024-10-11 03:17:18,685 INFO L226 Difference]: Without dead ends: 1067 [2024-10-11 03:17:18,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:18,688 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 145 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:18,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1513 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-10-11 03:17:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 964. [2024-10-11 03:17:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 737 states have (on average 1.3772048846675713) internal successors, (1015), 747 states have internal predecessors, (1015), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-11 03:17:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1305 transitions. [2024-10-11 03:17:18,749 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1305 transitions. Word has length 88 [2024-10-11 03:17:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:18,749 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1305 transitions. [2024-10-11 03:17:18,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:17:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1305 transitions. [2024-10-11 03:17:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:17:18,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:18,750 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:18,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:17:18,751 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:18,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash -741171965, now seen corresponding path program 1 times [2024-10-11 03:17:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:18,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532014249] [2024-10-11 03:17:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:17:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:17:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:17:19,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:19,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532014249] [2024-10-11 03:17:19,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532014249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:19,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:19,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:19,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226875577] [2024-10-11 03:17:19,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:19,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:19,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:19,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:19,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:19,114 INFO L87 Difference]: Start difference. First operand 964 states and 1305 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:17:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:19,537 INFO L93 Difference]: Finished difference Result 1859 states and 2511 transitions. [2024-10-11 03:17:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2024-10-11 03:17:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:19,542 INFO L225 Difference]: With dead ends: 1859 [2024-10-11 03:17:19,542 INFO L226 Difference]: Without dead ends: 1051 [2024-10-11 03:17:19,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:17:19,544 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 659 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:19,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1351 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:17:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-11 03:17:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1002. [2024-10-11 03:17:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 760 states have (on average 1.3539473684210526) internal successors, (1029), 771 states have internal predecessors, (1029), 154 states have call successors, (154), 87 states have call predecessors, (154), 87 states have return successors, (154), 143 states have call predecessors, (154), 154 states have call successors, (154) [2024-10-11 03:17:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1337 transitions. [2024-10-11 03:17:19,623 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1337 transitions. Word has length 89 [2024-10-11 03:17:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:19,623 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1337 transitions. [2024-10-11 03:17:19,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:17:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1337 transitions. [2024-10-11 03:17:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:17:19,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:19,624 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:19,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:17:19,624 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:19,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1765724356, now seen corresponding path program 1 times [2024-10-11 03:17:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:19,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537688019] [2024-10-11 03:17:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:17:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 03:17:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:17:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537688019] [2024-10-11 03:17:20,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537688019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:20,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:20,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677388864] [2024-10-11 03:17:20,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:20,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:20,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:20,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:20,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:20,005 INFO L87 Difference]: Start difference. First operand 1002 states and 1337 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 03:17:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:20,508 INFO L93 Difference]: Finished difference Result 1942 states and 2575 transitions. [2024-10-11 03:17:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:20,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2024-10-11 03:17:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:20,514 INFO L225 Difference]: With dead ends: 1942 [2024-10-11 03:17:20,514 INFO L226 Difference]: Without dead ends: 1109 [2024-10-11 03:17:20,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:17:20,516 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 520 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:20,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1339 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:17:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-10-11 03:17:20,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1024. [2024-10-11 03:17:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 774 states have (on average 1.3372093023255813) internal successors, (1035), 786 states have internal predecessors, (1035), 157 states have call successors, (157), 92 states have call predecessors, (157), 92 states have return successors, (157), 145 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-11 03:17:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1349 transitions. [2024-10-11 03:17:20,598 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1349 transitions. Word has length 91 [2024-10-11 03:17:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:20,599 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1349 transitions. [2024-10-11 03:17:20,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 03:17:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1349 transitions. [2024-10-11 03:17:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:17:20,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:20,600 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:20,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:17:20,600 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:20,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:20,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1782988361, now seen corresponding path program 1 times [2024-10-11 03:17:20,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:20,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674294362] [2024-10-11 03:17:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:17:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:17:20,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:20,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674294362] [2024-10-11 03:17:20,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674294362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:20,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:20,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499271811] [2024-10-11 03:17:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:20,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:20,673 INFO L87 Difference]: Start difference. First operand 1024 states and 1349 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:20,876 INFO L93 Difference]: Finished difference Result 2682 states and 3557 transitions. [2024-10-11 03:17:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:20,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2024-10-11 03:17:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:20,884 INFO L225 Difference]: With dead ends: 2682 [2024-10-11 03:17:20,884 INFO L226 Difference]: Without dead ends: 1905 [2024-10-11 03:17:20,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:20,887 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 195 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:20,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1096 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2024-10-11 03:17:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1734. [2024-10-11 03:17:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1296 states have (on average 1.3356481481481481) internal successors, (1731), 1316 states have internal predecessors, (1731), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-10-11 03:17:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2291 transitions. [2024-10-11 03:17:21,020 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2291 transitions. Word has length 92 [2024-10-11 03:17:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:21,020 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2291 transitions. [2024-10-11 03:17:21,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2291 transitions. [2024-10-11 03:17:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:17:21,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:21,022 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:21,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:17:21,022 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:21,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash 890629356, now seen corresponding path program 1 times [2024-10-11 03:17:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:21,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722715956] [2024-10-11 03:17:21,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:21,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:17:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:17:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722715956] [2024-10-11 03:17:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722715956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006812948] [2024-10-11 03:17:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:21,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:21,106 INFO L87 Difference]: Start difference. First operand 1734 states and 2291 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:21,380 INFO L93 Difference]: Finished difference Result 4412 states and 5861 transitions. [2024-10-11 03:17:21,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:21,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-11 03:17:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:21,392 INFO L225 Difference]: With dead ends: 4412 [2024-10-11 03:17:21,393 INFO L226 Difference]: Without dead ends: 2994 [2024-10-11 03:17:21,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:21,396 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 202 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:21,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1132 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-10-11 03:17:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2745. [2024-10-11 03:17:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2032 states have (on average 1.3228346456692914) internal successors, (2688), 2063 states have internal predecessors, (2688), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-10-11 03:17:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3608 transitions. [2024-10-11 03:17:21,633 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3608 transitions. Word has length 94 [2024-10-11 03:17:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:21,634 INFO L471 AbstractCegarLoop]: Abstraction has 2745 states and 3608 transitions. [2024-10-11 03:17:21,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3608 transitions. [2024-10-11 03:17:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:17:21,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:21,636 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:21,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:17:21,636 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:21,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1142837102, now seen corresponding path program 1 times [2024-10-11 03:17:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:21,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316733915] [2024-10-11 03:17:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:17:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 03:17:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:17:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 03:17:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 03:17:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 03:17:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:17:21,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316733915] [2024-10-11 03:17:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316733915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:21,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822904980] [2024-10-11 03:17:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:21,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:21,714 INFO L87 Difference]: Start difference. First operand 2745 states and 3608 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:22,167 INFO L93 Difference]: Finished difference Result 6428 states and 8486 transitions. [2024-10-11 03:17:22,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:22,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-11 03:17:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:22,186 INFO L225 Difference]: With dead ends: 6428 [2024-10-11 03:17:22,186 INFO L226 Difference]: Without dead ends: 4115 [2024-10-11 03:17:22,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:22,192 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 196 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:22,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1146 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2024-10-11 03:17:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 3942. [2024-10-11 03:17:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 2905 states have (on average 1.3180722891566266) internal successors, (3829), 2949 states have internal predecessors, (3829), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-11 03:17:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 5173 transitions. [2024-10-11 03:17:22,502 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 5173 transitions. Word has length 94 [2024-10-11 03:17:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:22,503 INFO L471 AbstractCegarLoop]: Abstraction has 3942 states and 5173 transitions. [2024-10-11 03:17:22,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 5173 transitions. [2024-10-11 03:17:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:17:22,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:22,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:22,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:17:22,505 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:22,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash -116500221, now seen corresponding path program 1 times [2024-10-11 03:17:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:22,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282544347] [2024-10-11 03:17:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:17:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282544347] [2024-10-11 03:17:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282544347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287018966] [2024-10-11 03:17:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:22,559 INFO L87 Difference]: Start difference. First operand 3942 states and 5173 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:22,896 INFO L93 Difference]: Finished difference Result 7585 states and 9999 transitions. [2024-10-11 03:17:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2024-10-11 03:17:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:22,930 INFO L225 Difference]: With dead ends: 7585 [2024-10-11 03:17:22,931 INFO L226 Difference]: Without dead ends: 3975 [2024-10-11 03:17:22,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:22,941 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 6 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:22,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 466 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2024-10-11 03:17:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3948. [2024-10-11 03:17:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 2911 states have (on average 1.3174166952937134) internal successors, (3835), 2955 states have internal predecessors, (3835), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-11 03:17:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5179 transitions. [2024-10-11 03:17:23,262 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5179 transitions. Word has length 95 [2024-10-11 03:17:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:23,263 INFO L471 AbstractCegarLoop]: Abstraction has 3948 states and 5179 transitions. [2024-10-11 03:17:23,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5179 transitions. [2024-10-11 03:17:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:17:23,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:23,265 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:23,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:17:23,265 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:23,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1006279155, now seen corresponding path program 1 times [2024-10-11 03:17:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353776249] [2024-10-11 03:17:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:23,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:23,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:17:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:23,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 03:17:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:17:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:23,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 03:17:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:23,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 03:17:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:23,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 03:17:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:17:23,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:23,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353776249] [2024-10-11 03:17:23,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353776249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:23,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:23,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:23,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034699743] [2024-10-11 03:17:23,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:23,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:23,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:23,381 INFO L87 Difference]: Start difference. First operand 3948 states and 5179 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:23,695 INFO L93 Difference]: Finished difference Result 7551 states and 9927 transitions. [2024-10-11 03:17:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2024-10-11 03:17:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:23,723 INFO L225 Difference]: With dead ends: 7551 [2024-10-11 03:17:23,724 INFO L226 Difference]: Without dead ends: 3669 [2024-10-11 03:17:23,732 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:23,732 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 78 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:23,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 711 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2024-10-11 03:17:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3606. [2024-10-11 03:17:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 2652 states have (on average 1.3273001508295625) internal successors, (3520), 2686 states have internal predecessors, (3520), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-11 03:17:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 4760 transitions. [2024-10-11 03:17:24,185 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 4760 transitions. Word has length 96 [2024-10-11 03:17:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:24,186 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 4760 transitions. [2024-10-11 03:17:24,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 4760 transitions. [2024-10-11 03:17:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:17:24,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:24,188 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:24,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:17:24,189 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:24,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash 976654501, now seen corresponding path program 1 times [2024-10-11 03:17:24,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:24,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559081016] [2024-10-11 03:17:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:17:24,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559081016] [2024-10-11 03:17:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559081016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:24,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056623529] [2024-10-11 03:17:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:24,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:24,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:24,256 INFO L87 Difference]: Start difference. First operand 3606 states and 4760 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:24,602 INFO L93 Difference]: Finished difference Result 7094 states and 9402 transitions. [2024-10-11 03:17:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:24,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-11 03:17:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:24,615 INFO L225 Difference]: With dead ends: 7094 [2024-10-11 03:17:24,615 INFO L226 Difference]: Without dead ends: 3657 [2024-10-11 03:17:24,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:24,621 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 6 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:24,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 466 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2024-10-11 03:17:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3616. [2024-10-11 03:17:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 2662 states have (on average 1.3260706235912847) internal successors, (3530), 2696 states have internal predecessors, (3530), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-11 03:17:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 4770 transitions. [2024-10-11 03:17:24,870 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 4770 transitions. Word has length 97 [2024-10-11 03:17:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:24,870 INFO L471 AbstractCegarLoop]: Abstraction has 3616 states and 4770 transitions. [2024-10-11 03:17:24,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 4770 transitions. [2024-10-11 03:17:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:17:24,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:24,872 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:24,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:17:24,872 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:24,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1105968182, now seen corresponding path program 1 times [2024-10-11 03:17:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:24,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163091869] [2024-10-11 03:17:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:24,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:17:24,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:24,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163091869] [2024-10-11 03:17:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163091869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:24,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:24,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104866483] [2024-10-11 03:17:24,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:24,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:24,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:24,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:24,975 INFO L87 Difference]: Start difference. First operand 3616 states and 4770 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:25,270 INFO L93 Difference]: Finished difference Result 7044 states and 9312 transitions. [2024-10-11 03:17:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:25,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-11 03:17:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:25,283 INFO L225 Difference]: With dead ends: 7044 [2024-10-11 03:17:25,284 INFO L226 Difference]: Without dead ends: 3537 [2024-10-11 03:17:25,288 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:25,289 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 60 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:25,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 716 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:25,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2024-10-11 03:17:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 2729. [2024-10-11 03:17:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2009 states have (on average 1.320059731209557) internal successors, (2652), 2028 states have internal predecessors, (2652), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-10-11 03:17:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 3590 transitions. [2024-10-11 03:17:25,482 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 3590 transitions. Word has length 97 [2024-10-11 03:17:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:25,483 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 3590 transitions. [2024-10-11 03:17:25,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 3590 transitions. [2024-10-11 03:17:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 03:17:25,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:25,486 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:17:25,486 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:25,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1294447064, now seen corresponding path program 1 times [2024-10-11 03:17:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:25,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319375788] [2024-10-11 03:17:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:25,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 03:17:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 03:17:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 03:17:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 03:17:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 03:17:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 03:17:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:25,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319375788] [2024-10-11 03:17:25,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319375788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:25,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230555912] [2024-10-11 03:17:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:25,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:25,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:25,749 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:25,750 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:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 03:17:25,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:26,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230555912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:26,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:26,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2024-10-11 03:17:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418804765] [2024-10-11 03:17:26,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:26,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:17:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:17:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:17:26,463 INFO L87 Difference]: Start difference. First operand 2729 states and 3590 transitions. Second operand has 22 states, 22 states have (on average 10.045454545454545) internal successors, (221), 20 states have internal predecessors, (221), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-11 03:17:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:30,877 INFO L93 Difference]: Finished difference Result 11334 states and 14831 transitions. [2024-10-11 03:17:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-11 03:17:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.045454545454545) internal successors, (221), 20 states have internal predecessors, (221), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 140 [2024-10-11 03:17:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:30,921 INFO L225 Difference]: With dead ends: 11334 [2024-10-11 03:17:30,921 INFO L226 Difference]: Without dead ends: 8815 [2024-10-11 03:17:30,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2024-10-11 03:17:30,933 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 5571 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 2233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5571 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 3868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2233 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:30,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5571 Valid, 3568 Invalid, 3868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2233 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 03:17:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8815 states. [2024-10-11 03:17:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8815 to 7343. [2024-10-11 03:17:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7343 states, 5386 states have (on average 1.3078351281099145) internal successors, (7044), 5438 states have internal predecessors, (7044), 1259 states have call successors, (1259), 697 states have call predecessors, (1259), 697 states have return successors, (1259), 1207 states have call predecessors, (1259), 1259 states have call successors, (1259) [2024-10-11 03:17:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7343 states to 7343 states and 9562 transitions. [2024-10-11 03:17:31,833 INFO L78 Accepts]: Start accepts. Automaton has 7343 states and 9562 transitions. Word has length 140 [2024-10-11 03:17:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:31,834 INFO L471 AbstractCegarLoop]: Abstraction has 7343 states and 9562 transitions. [2024-10-11 03:17:31,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.045454545454545) internal successors, (221), 20 states have internal predecessors, (221), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-11 03:17:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7343 states and 9562 transitions. [2024-10-11 03:17:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 03:17:31,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:31,851 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:17:32,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 03:17:32,057 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:32,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1378533458, now seen corresponding path program 1 times [2024-10-11 03:17:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:32,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138131316] [2024-10-11 03:17:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 03:17:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 03:17:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 03:17:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 03:17:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:17:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 03:17:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-11 03:17:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:32,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138131316] [2024-10-11 03:17:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138131316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:32,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:32,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541094297] [2024-10-11 03:17:32,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:32,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:32,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:32,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:32,215 INFO L87 Difference]: Start difference. First operand 7343 states and 9562 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 03:17:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:33,723 INFO L93 Difference]: Finished difference Result 21325 states and 27878 transitions. [2024-10-11 03:17:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:33,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 143 [2024-10-11 03:17:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:33,768 INFO L225 Difference]: With dead ends: 21325 [2024-10-11 03:17:33,768 INFO L226 Difference]: Without dead ends: 14450 [2024-10-11 03:17:33,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:17:33,785 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 219 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:33,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 2074 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14450 states. [2024-10-11 03:17:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14450 to 12172. [2024-10-11 03:17:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12172 states, 8851 states have (on average 1.3057281663088915) internal successors, (11557), 8941 states have internal predecessors, (11557), 2161 states have call successors, (2161), 1159 states have call predecessors, (2161), 1159 states have return successors, (2161), 2071 states have call predecessors, (2161), 2161 states have call successors, (2161) [2024-10-11 03:17:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12172 states to 12172 states and 15879 transitions. [2024-10-11 03:17:35,393 INFO L78 Accepts]: Start accepts. Automaton has 12172 states and 15879 transitions. Word has length 143 [2024-10-11 03:17:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:35,394 INFO L471 AbstractCegarLoop]: Abstraction has 12172 states and 15879 transitions. [2024-10-11 03:17:35,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 03:17:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 12172 states and 15879 transitions. [2024-10-11 03:17:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 03:17:35,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:35,411 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:17:35,411 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:35,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash -371025756, now seen corresponding path program 1 times [2024-10-11 03:17:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:35,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675963946] [2024-10-11 03:17:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:35,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:35,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:35,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:35,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:35,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:35,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 03:17:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:17:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:17:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 03:17:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 03:17:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 03:17:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:17:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 03:17:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 03:17:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675963946] [2024-10-11 03:17:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675963946] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427271982] [2024-10-11 03:17:36,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:36,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:36,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:36,031 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:36,032 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:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 03:17:36,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:36,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 03:17:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427271982] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:36,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:17:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 25 [2024-10-11 03:17:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297941454] [2024-10-11 03:17:36,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:17:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:36,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:17:36,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:17:36,621 INFO L87 Difference]: Start difference. First operand 12172 states and 15879 transitions. Second operand has 9 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 03:17:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:38,127 INFO L93 Difference]: Finished difference Result 23940 states and 31256 transitions. [2024-10-11 03:17:38,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:17:38,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 143 [2024-10-11 03:17:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:38,164 INFO L225 Difference]: With dead ends: 23940 [2024-10-11 03:17:38,164 INFO L226 Difference]: Without dead ends: 12236 [2024-10-11 03:17:38,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:17:38,184 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 372 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:38,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1424 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:17:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12236 states. [2024-10-11 03:17:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12236 to 8288. [2024-10-11 03:17:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8288 states, 6061 states have (on average 1.310509816861904) internal successors, (7943), 6116 states have internal predecessors, (7943), 1444 states have call successors, (1444), 782 states have call predecessors, (1444), 782 states have return successors, (1444), 1389 states have call predecessors, (1444), 1444 states have call successors, (1444) [2024-10-11 03:17:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8288 states to 8288 states and 10831 transitions. [2024-10-11 03:17:39,076 INFO L78 Accepts]: Start accepts. Automaton has 8288 states and 10831 transitions. Word has length 143 [2024-10-11 03:17:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:39,076 INFO L471 AbstractCegarLoop]: Abstraction has 8288 states and 10831 transitions. [2024-10-11 03:17:39,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 03:17:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 8288 states and 10831 transitions. [2024-10-11 03:17:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 03:17:39,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:39,088 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,103 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:39,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:39,289 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:39,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash -297425047, now seen corresponding path program 1 times [2024-10-11 03:17:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579174670] [2024-10-11 03:17:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 03:17:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:17:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:17:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 03:17:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:17:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:17:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:17:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 03:17:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579174670] [2024-10-11 03:17:40,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579174670] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114377708] [2024-10-11 03:17:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:40,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:40,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:40,262 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:40,264 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:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:40,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 03:17:40,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:40,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 03:17:40,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114377708] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:40,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:40,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2024-10-11 03:17:40,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092170937] [2024-10-11 03:17:40,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:40,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:17:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:40,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:17:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:17:40,929 INFO L87 Difference]: Start difference. First operand 8288 states and 10831 transitions. Second operand has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 24 states have internal predecessors, (251), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-11 03:17:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:45,858 INFO L93 Difference]: Finished difference Result 19457 states and 25474 transitions. [2024-10-11 03:17:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-11 03:17:45,859 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 24 states have internal predecessors, (251), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) Word has length 144 [2024-10-11 03:17:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:45,907 INFO L225 Difference]: With dead ends: 19457 [2024-10-11 03:17:45,907 INFO L226 Difference]: Without dead ends: 11381 [2024-10-11 03:17:45,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1022, Invalid=4830, Unknown=0, NotChecked=0, Total=5852 [2024-10-11 03:17:45,929 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 1764 mSDsluCounter, 7785 mSDsCounter, 0 mSdLazyCounter, 4209 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 8509 SdHoareTripleChecker+Invalid, 4795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 4209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:45,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 8509 Invalid, 4795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 4209 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 03:17:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11381 states. [2024-10-11 03:17:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11381 to 7634. [2024-10-11 03:17:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7634 states, 5607 states have (on average 1.3051542714464064) internal successors, (7318), 5657 states have internal predecessors, (7318), 1315 states have call successors, (1315), 711 states have call predecessors, (1315), 711 states have return successors, (1315), 1265 states have call predecessors, (1315), 1315 states have call successors, (1315) [2024-10-11 03:17:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7634 states to 7634 states and 9948 transitions. [2024-10-11 03:17:46,938 INFO L78 Accepts]: Start accepts. Automaton has 7634 states and 9948 transitions. Word has length 144 [2024-10-11 03:17:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:46,939 INFO L471 AbstractCegarLoop]: Abstraction has 7634 states and 9948 transitions. [2024-10-11 03:17:46,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 24 states have internal predecessors, (251), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-11 03:17:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7634 states and 9948 transitions. [2024-10-11 03:17:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:17:46,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:46,947 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,961 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:47,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:47,148 INFO L396 AbstractCegarLoop]: === Iteration 32 === 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 1487247464, 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 [230725496] [2024-10-11 03:17:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:47,313 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 52 [2024-10-11 03:17:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 03:17:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:17:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:17:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 03:17:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 03:17:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 03:17:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 03:17:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230725496] [2024-10-11 03:17:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230725496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907828660] [2024-10-11 03:17:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:47,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:47,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:47,344 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:47,345 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:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 03:17:47,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 84 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:17:47,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 03:17:47,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907828660] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:47,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:47,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2024-10-11 03:17:47,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404847749] [2024-10-11 03:17:47,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:47,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:17:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:47,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:17:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:47,767 INFO L87 Difference]: Start difference. First operand 7634 states and 9948 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-11 03:17:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:49,441 INFO L93 Difference]: Finished difference Result 20686 states and 26760 transitions. [2024-10-11 03:17:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:17:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 147 [2024-10-11 03:17:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:49,492 INFO L225 Difference]: With dead ends: 20686 [2024-10-11 03:17:49,492 INFO L226 Difference]: Without dead ends: 13370 [2024-10-11 03:17:49,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 318 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:17:49,510 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 354 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:49,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1646 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13370 states. [2024-10-11 03:17:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13370 to 11554. [2024-10-11 03:17:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11554 states, 8521 states have (on average 1.2912803661542072) internal successors, (11003), 8617 states have internal predecessors, (11003), 1943 states have call successors, (1943), 1089 states have call predecessors, (1943), 1089 states have return successors, (1943), 1847 states have call predecessors, (1943), 1943 states have call successors, (1943) [2024-10-11 03:17:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11554 states to 11554 states and 14889 transitions. [2024-10-11 03:17:51,016 INFO L78 Accepts]: Start accepts. Automaton has 11554 states and 14889 transitions. Word has length 147 [2024-10-11 03:17:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:51,016 INFO L471 AbstractCegarLoop]: Abstraction has 11554 states and 14889 transitions. [2024-10-11 03:17:51,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-11 03:17:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 11554 states and 14889 transitions. [2024-10-11 03:17:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 03:17:51,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:51,030 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,046 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:51,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 03:17:51,234 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:51,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:51,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1716116480, now seen corresponding path program 1 times [2024-10-11 03:17:51,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:51,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324867484] [2024-10-11 03:17:51,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:51,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:17:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:17:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 03:17:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:17:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 03:17:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 03:17:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:51,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324867484] [2024-10-11 03:17:51,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324867484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699113940] [2024-10-11 03:17:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:51,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:51,504 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:51,505 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:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:51,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 03:17:51,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:51,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:52,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699113940] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:52,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:52,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-10-11 03:17:52,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463791165] [2024-10-11 03:17:52,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:52,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:17:52,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:17:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:17:52,289 INFO L87 Difference]: Start difference. First operand 11554 states and 14889 transitions. Second operand has 23 states, 23 states have (on average 9.956521739130435) internal successors, (229), 22 states have internal predecessors, (229), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-10-11 03:17:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:58,685 INFO L93 Difference]: Finished difference Result 31004 states and 40120 transitions. [2024-10-11 03:17:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-10-11 03:17:58,686 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.956521739130435) internal successors, (229), 22 states have internal predecessors, (229), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) Word has length 146 [2024-10-11 03:17:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:58,755 INFO L225 Difference]: With dead ends: 31004 [2024-10-11 03:17:58,756 INFO L226 Difference]: Without dead ends: 20408 [2024-10-11 03:17:58,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8536 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2872, Invalid=20080, Unknown=0, NotChecked=0, Total=22952 [2024-10-11 03:17:58,783 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 3101 mSDsluCounter, 4919 mSDsCounter, 0 mSdLazyCounter, 3175 mSolverCounterSat, 1037 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3101 SdHoareTripleChecker+Valid, 5404 SdHoareTripleChecker+Invalid, 4212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1037 IncrementalHoareTripleChecker+Valid, 3175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:58,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3101 Valid, 5404 Invalid, 4212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1037 Valid, 3175 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:17:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20408 states. [2024-10-11 03:18:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20408 to 18078. [2024-10-11 03:18:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18078 states, 13461 states have (on average 1.2799197682193002) internal successors, (17229), 13603 states have internal predecessors, (17229), 2925 states have call successors, (2925), 1691 states have call predecessors, (2925), 1691 states have return successors, (2925), 2783 states have call predecessors, (2925), 2925 states have call successors, (2925) [2024-10-11 03:18:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18078 states to 18078 states and 23079 transitions. [2024-10-11 03:18:01,836 INFO L78 Accepts]: Start accepts. Automaton has 18078 states and 23079 transitions. Word has length 146 [2024-10-11 03:18:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:01,836 INFO L471 AbstractCegarLoop]: Abstraction has 18078 states and 23079 transitions. [2024-10-11 03:18:01,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.956521739130435) internal successors, (229), 22 states have internal predecessors, (229), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-10-11 03:18:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 18078 states and 23079 transitions. [2024-10-11 03:18:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 03:18:01,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:01,846 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 03:18:02,046 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,SelfDestructingSolverStorable32 [2024-10-11 03:18:02,047 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:02,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:02,047 INFO L85 PathProgramCache]: Analyzing trace with hash 755167063, now seen corresponding path program 1 times [2024-10-11 03:18:02,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:02,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838987666] [2024-10-11 03:18:02,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:02,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:18:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:18:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:18:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:18:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:18:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:18:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:18:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:18:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:18:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 03:18:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:18:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 03:18:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 03:18:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 03:18:02,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:02,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838987666] [2024-10-11 03:18:02,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838987666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:02,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117945028] [2024-10-11 03:18:02,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:02,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:02,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:02,604 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:18:02,608 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:18:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:02,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 03:18:02,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 03:18:02,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-11 03:18:02,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117945028] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:02,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:02,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-10-11 03:18:02,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860634349] [2024-10-11 03:18:02,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:02,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 03:18:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:02,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 03:18:02,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:18:02,929 INFO L87 Difference]: Start difference. First operand 18078 states and 23079 transitions. Second operand has 15 states, 14 states have (on average 11.714285714285714) internal successors, (164), 12 states have internal predecessors, (164), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32) [2024-10-11 03:18:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:07,032 INFO L93 Difference]: Finished difference Result 44168 states and 55824 transitions. [2024-10-11 03:18:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 03:18:07,033 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 11.714285714285714) internal successors, (164), 12 states have internal predecessors, (164), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32) Word has length 146 [2024-10-11 03:18:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:07,123 INFO L225 Difference]: With dead ends: 44168 [2024-10-11 03:18:07,123 INFO L226 Difference]: Without dead ends: 26319 [2024-10-11 03:18:07,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:18:07,155 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 206 mSDsluCounter, 2697 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:07,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 2956 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:18:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26319 states. [2024-10-11 03:18:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26319 to 17906. [2024-10-11 03:18:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17906 states, 13363 states have (on average 1.2699992516650453) internal successors, (16971), 13505 states have internal predecessors, (16971), 2820 states have call successors, (2820), 1722 states have call predecessors, (2820), 1722 states have return successors, (2820), 2678 states have call predecessors, (2820), 2820 states have call successors, (2820) [2024-10-11 03:18:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17906 states to 17906 states and 22611 transitions. [2024-10-11 03:18:09,994 INFO L78 Accepts]: Start accepts. Automaton has 17906 states and 22611 transitions. Word has length 146 [2024-10-11 03:18:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:09,995 INFO L471 AbstractCegarLoop]: Abstraction has 17906 states and 22611 transitions. [2024-10-11 03:18:09,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 11.714285714285714) internal successors, (164), 12 states have internal predecessors, (164), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32) [2024-10-11 03:18:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 17906 states and 22611 transitions. [2024-10-11 03:18:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 03:18:10,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:10,004 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 03:18:10,204 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,SelfDestructingSolverStorable33 [2024-10-11 03:18:10,205 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:10,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1215574953, now seen corresponding path program 1 times [2024-10-11 03:18:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:10,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681457522] [2024-10-11 03:18:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:18:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:18:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:18:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:18:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:18:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:18:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:18:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 03:18:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 03:18:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 03:18:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 03:18:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 03:18:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 03:18:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 03:18:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-11 03:18:10,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681457522] [2024-10-11 03:18:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681457522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255841482] [2024-10-11 03:18:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:10,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:10,726 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:18:10,726 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:18:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-11 03:18:10,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 03:18:11,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-11 03:18:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255841482] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:12,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:12,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 13] total 28 [2024-10-11 03:18:12,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132677938] [2024-10-11 03:18:12,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:12,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 03:18:12,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:12,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 03:18:12,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:18:12,178 INFO L87 Difference]: Start difference. First operand 17906 states and 22611 transitions. Second operand has 28 states, 28 states have (on average 8.392857142857142) internal successors, (235), 28 states have internal predecessors, (235), 10 states have call successors, (44), 5 states have call predecessors, (44), 6 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2024-10-11 03:18:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:21,184 INFO L93 Difference]: Finished difference Result 34220 states and 43354 transitions. [2024-10-11 03:18:21,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-10-11 03:18:21,184 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.392857142857142) internal successors, (235), 28 states have internal predecessors, (235), 10 states have call successors, (44), 5 states have call predecessors, (44), 6 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) Word has length 162 [2024-10-11 03:18:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:21,256 INFO L225 Difference]: With dead ends: 34220 [2024-10-11 03:18:21,256 INFO L226 Difference]: Without dead ends: 18701 [2024-10-11 03:18:21,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2206, Invalid=10004, Unknown=0, NotChecked=0, Total=12210 [2024-10-11 03:18:21,282 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 4731 mSDsluCounter, 3526 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 3924 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:21,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 3924 Invalid, 3969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:18:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18701 states. [2024-10-11 03:18:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18701 to 18329. [2024-10-11 03:18:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18329 states, 13690 states have (on average 1.2682249817384952) internal successors, (17362), 13820 states have internal predecessors, (17362), 2851 states have call successors, (2851), 1787 states have call predecessors, (2851), 1787 states have return successors, (2851), 2721 states have call predecessors, (2851), 2851 states have call successors, (2851) [2024-10-11 03:18:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18329 states to 18329 states and 23064 transitions. [2024-10-11 03:18:24,798 INFO L78 Accepts]: Start accepts. Automaton has 18329 states and 23064 transitions. Word has length 162 [2024-10-11 03:18:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:24,799 INFO L471 AbstractCegarLoop]: Abstraction has 18329 states and 23064 transitions. [2024-10-11 03:18:24,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.392857142857142) internal successors, (235), 28 states have internal predecessors, (235), 10 states have call successors, (44), 5 states have call predecessors, (44), 6 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2024-10-11 03:18:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 18329 states and 23064 transitions. [2024-10-11 03:18:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 03:18:24,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:24,806 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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:24,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 03:18:25,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:25,006 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:25,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash -924119329, now seen corresponding path program 1 times [2024-10-11 03:18:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:25,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735923455] [2024-10-11 03:18:25,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:18:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:18:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:18:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:18:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:18:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:18:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:18:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 03:18:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:18:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:18:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:18:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 03:18:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 03:18:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:18:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 03:18:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 03:18:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-11 03:18:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735923455] [2024-10-11 03:18:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735923455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167575342] [2024-10-11 03:18:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:25,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:25,523 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:25,524 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:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:25,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 03:18:25,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 35 proven. 68 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 03:18:25,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-11 03:18:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167575342] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:26,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 23 [2024-10-11 03:18:26,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188936923] [2024-10-11 03:18:26,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:26,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:18:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:18:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:18:26,044 INFO L87 Difference]: Start difference. First operand 18329 states and 23064 transitions. Second operand has 23 states, 23 states have (on average 10.0) internal successors, (230), 20 states have internal predecessors, (230), 9 states have call successors, (47), 4 states have call predecessors, (47), 8 states have return successors, (47), 12 states have call predecessors, (47), 9 states have call successors, (47) [2024-10-11 03:18:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:30,379 INFO L93 Difference]: Finished difference Result 32703 states and 40903 transitions. [2024-10-11 03:18:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 03:18:30,380 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.0) internal successors, (230), 20 states have internal predecessors, (230), 9 states have call successors, (47), 4 states have call predecessors, (47), 8 states have return successors, (47), 12 states have call predecessors, (47), 9 states have call successors, (47) Word has length 165 [2024-10-11 03:18:30,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:30,451 INFO L225 Difference]: With dead ends: 32703 [2024-10-11 03:18:30,452 INFO L226 Difference]: Without dead ends: 17907 [2024-10-11 03:18:30,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 355 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 03:18:30,475 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1343 mSDsluCounter, 3702 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 4089 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:30,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 4089 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:18:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17907 states.