./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2d013ffa4d7cd59307ce87b23dd696caa1ad1374742fbf879c50e37b4a890a2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:51:15,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:51:15,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:51:15,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:51:15,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:51:15,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:51:15,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:51:15,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:51:15,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:51:15,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:51:15,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:51:15,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:51:15,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:51:15,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:51:15,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:51:15,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:51:15,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:51:15,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:51:15,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:51:15,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:51:15,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:51:15,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:51:15,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:51:15,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:51:15,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:51:15,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:51:15,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:51:15,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:51:15,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:51:15,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:51:15,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:51:15,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:51:15,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:51:15,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:51:15,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:51:15,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:51:15,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:51:15,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:51:15,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:51:15,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:51:15,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:51:15,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:51:15,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2d013ffa4d7cd59307ce87b23dd696caa1ad1374742fbf879c50e37b4a890a2 [2024-11-19 00:51:15,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:51:15,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:51:15,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:51:15,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:51:15,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:51:15,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i [2024-11-19 00:51:17,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:51:17,330 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:51:17,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i [2024-11-19 00:51:17,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4afaf8a/be785f18a23c43c5898f63a3ac692257/FLAG91b71a2a7 [2024-11-19 00:51:17,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4afaf8a/be785f18a23c43c5898f63a3ac692257 [2024-11-19 00:51:17,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:51:17,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:51:17,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:51:17,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:51:17,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:51:17,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a279c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17, skipping insertion in model container [2024-11-19 00:51:17,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:51:17,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i[917,930] [2024-11-19 00:51:17,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:51:17,668 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:51:17,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-89.i[917,930] [2024-11-19 00:51:17,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:51:17,724 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:51:17,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17 WrapperNode [2024-11-19 00:51:17,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:51:17,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:51:17,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:51:17,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:51:17,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,801 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2024-11-19 00:51:17,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:51:17,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:51:17,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:51:17,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:51:17,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,849 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 44, 29, 5, 13, 14]. 41 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 5, 3, 1, 1, 2]. The 15 writes are split as follows [0, 8, 3, 1, 1, 2]. [2024-11-19 00:51:17,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:51:17,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:51:17,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:51:17,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:51:17,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (1/1) ... [2024-11-19 00:51:17,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:51:17,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:51:17,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:51:17,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:51:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:51:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:51:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:51:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:51:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:51:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:51:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:51:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:51:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:51:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:51:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:51:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:51:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:51:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:51:17,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:51:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:51:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:51:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:51:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:51:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:51:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:51:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:51:17,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:51:18,117 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:51:18,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:51:18,617 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-19 00:51:18,617 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:51:18,638 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:51:18,638 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:51:18,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:51:18 BoogieIcfgContainer [2024-11-19 00:51:18,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:51:18,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:51:18,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:51:18,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:51:18,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:51:17" (1/3) ... [2024-11-19 00:51:18,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d2da7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:51:18, skipping insertion in model container [2024-11-19 00:51:18,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:51:17" (2/3) ... [2024-11-19 00:51:18,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d2da7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:51:18, skipping insertion in model container [2024-11-19 00:51:18,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:51:18" (3/3) ... [2024-11-19 00:51:18,651 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-89.i [2024-11-19 00:51:18,667 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:51:18,668 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:51:18,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:51:18,748 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;@136d227f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:51:18,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:51:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:51:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:18,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:18,769 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:18,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:18,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash 80080085, now seen corresponding path program 1 times [2024-11-19 00:51:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:18,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229195529] [2024-11-19 00:51:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:18,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-19 00:51:19,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:19,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229195529] [2024-11-19 00:51:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229195529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:51:19,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576687200] [2024-11-19 00:51:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:19,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:51:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:51:19,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:51:19,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:51:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:19,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:51:19,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:51:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-19 00:51:19,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:51:19,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576687200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:19,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:51:19,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:51:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769711256] [2024-11-19 00:51:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:19,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:51:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:51:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:51:19,402 INFO L87 Difference]: Start difference. First operand has 102 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:19,436 INFO L93 Difference]: Finished difference Result 197 states and 307 transitions. [2024-11-19 00:51:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:51:19,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-19 00:51:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:19,444 INFO L225 Difference]: With dead ends: 197 [2024-11-19 00:51:19,445 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 00:51:19,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-11-19 00:51:19,452 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:19,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:51:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 00:51:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 00:51:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:51:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2024-11-19 00:51:19,491 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 109 [2024-11-19 00:51:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:19,492 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2024-11-19 00:51:19,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2024-11-19 00:51:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:19,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:19,495 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:19,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:51:19,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:51:19,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash 231956475, now seen corresponding path program 1 times [2024-11-19 00:51:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:19,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278489803] [2024-11-19 00:51:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:20,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278489803] [2024-11-19 00:51:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278489803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:51:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059600393] [2024-11-19 00:51:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:20,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:51:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:51:20,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:51:20,009 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:20,060 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-11-19 00:51:20,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:51:20,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-19 00:51:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:20,063 INFO L225 Difference]: With dead ends: 196 [2024-11-19 00:51:20,064 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 00:51:20,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:51:20,067 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:20,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:51:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 00:51:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-19 00:51:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:51:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2024-11-19 00:51:20,101 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 109 [2024-11-19 00:51:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:20,103 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2024-11-19 00:51:20,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2024-11-19 00:51:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:20,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:20,107 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:20,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:51:20,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:20,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash 912014845, now seen corresponding path program 1 times [2024-11-19 00:51:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:20,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962334698] [2024-11-19 00:51:20,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:20,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:20,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962334698] [2024-11-19 00:51:20,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962334698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:20,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:20,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:51:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275823446] [2024-11-19 00:51:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:20,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:51:20,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:20,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:51:20,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:51:20,362 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:20,400 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2024-11-19 00:51:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:51:20,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-19 00:51:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:20,404 INFO L225 Difference]: With dead ends: 200 [2024-11-19 00:51:20,404 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 00:51:20,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:51:20,406 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 404 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-11-19 00:51:20,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 404 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:51:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 00:51:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-19 00:51:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:51:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-11-19 00:51:20,423 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 109 [2024-11-19 00:51:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:20,425 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-11-19 00:51:20,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-11-19 00:51:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:20,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:20,431 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:20,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:51:20,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:20,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:20,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1607945089, now seen corresponding path program 1 times [2024-11-19 00:51:20,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:20,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414061868] [2024-11-19 00:51:20,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:20,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:20,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:20,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414061868] [2024-11-19 00:51:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414061868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:20,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:20,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:51:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094720713] [2024-11-19 00:51:20,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:20,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:51:20,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:51:20,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:51:20,615 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:20,651 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2024-11-19 00:51:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:51:20,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-19 00:51:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:20,653 INFO L225 Difference]: With dead ends: 204 [2024-11-19 00:51:20,653 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 00:51:20,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:51:20,658 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:20,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:51:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 00:51:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-19 00:51:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:51:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-11-19 00:51:20,669 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 109 [2024-11-19 00:51:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:20,669 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-11-19 00:51:20,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-11-19 00:51:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:20,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:20,672 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:20,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:51:20,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:20,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1606098047, now seen corresponding path program 1 times [2024-11-19 00:51:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:20,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231437144] [2024-11-19 00:51:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231437144] [2024-11-19 00:51:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231437144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:22,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:22,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181118294] [2024-11-19 00:51:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:22,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:22,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:22,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:22,809 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 00:51:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:23,513 INFO L93 Difference]: Finished difference Result 270 states and 383 transitions. [2024-11-19 00:51:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:51:23,514 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2024-11-19 00:51:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:23,515 INFO L225 Difference]: With dead ends: 270 [2024-11-19 00:51:23,516 INFO L226 Difference]: Without dead ends: 169 [2024-11-19 00:51:23,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:51:23,517 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 465 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:23,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 761 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:51:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-19 00:51:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2024-11-19 00:51:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.37) internal successors, (137), 100 states have internal predecessors, (137), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:51:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-19 00:51:23,539 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 109 [2024-11-19 00:51:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:23,540 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-19 00:51:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 00:51:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-19 00:51:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:23,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:23,543 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:23,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:51:23,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:23,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1667800895, now seen corresponding path program 1 times [2024-11-19 00:51:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560931323] [2024-11-19 00:51:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:23,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:24,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:24,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560931323] [2024-11-19 00:51:24,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560931323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:24,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:24,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:51:24,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973864333] [2024-11-19 00:51:24,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:24,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:51:24,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:24,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:51:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:51:24,081 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:24,311 INFO L93 Difference]: Finished difference Result 284 states and 403 transitions. [2024-11-19 00:51:24,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:51:24,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-19 00:51:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:24,314 INFO L225 Difference]: With dead ends: 284 [2024-11-19 00:51:24,314 INFO L226 Difference]: Without dead ends: 172 [2024-11-19 00:51:24,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:51:24,315 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 258 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:24,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 399 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-19 00:51:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2024-11-19 00:51:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:51:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-11-19 00:51:24,333 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 109 [2024-11-19 00:51:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:24,333 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-11-19 00:51:24,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-11-19 00:51:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:24,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:24,335 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:24,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:51:24,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:24,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1927988566, now seen corresponding path program 1 times [2024-11-19 00:51:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:24,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354687772] [2024-11-19 00:51:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:25,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354687772] [2024-11-19 00:51:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354687772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:25,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:25,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:51:25,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820980501] [2024-11-19 00:51:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:25,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:51:25,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:51:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:51:25,927 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 00:51:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:26,693 INFO L93 Difference]: Finished difference Result 449 states and 639 transitions. [2024-11-19 00:51:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:51:26,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2024-11-19 00:51:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:26,696 INFO L225 Difference]: With dead ends: 449 [2024-11-19 00:51:26,696 INFO L226 Difference]: Without dead ends: 328 [2024-11-19 00:51:26,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:51:26,698 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 556 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:26,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 539 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:51:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-19 00:51:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 321. [2024-11-19 00:51:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 281 states have (on average 1.3701067615658362) internal successors, (385), 282 states have internal predecessors, (385), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:51:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 457 transitions. [2024-11-19 00:51:26,732 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 457 transitions. Word has length 109 [2024-11-19 00:51:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:26,732 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 457 transitions. [2024-11-19 00:51:26,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 00:51:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 457 transitions. [2024-11-19 00:51:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:26,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:26,734 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:26,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:51:26,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:26,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:26,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1387243329, now seen corresponding path program 1 times [2024-11-19 00:51:26,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:26,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472755467] [2024-11-19 00:51:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:26,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:27,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:27,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472755467] [2024-11-19 00:51:27,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472755467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:27,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:27,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:51:27,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304690697] [2024-11-19 00:51:27,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:27,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:51:27,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:27,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:51:27,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:27,112 INFO L87 Difference]: Start difference. First operand 321 states and 457 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:27,452 INFO L93 Difference]: Finished difference Result 752 states and 1068 transitions. [2024-11-19 00:51:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-19 00:51:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:27,457 INFO L225 Difference]: With dead ends: 752 [2024-11-19 00:51:27,457 INFO L226 Difference]: Without dead ends: 434 [2024-11-19 00:51:27,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:51:27,458 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 249 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:27,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 520 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-19 00:51:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 337. [2024-11-19 00:51:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.3771043771043772) internal successors, (409), 298 states have internal predecessors, (409), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:51:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 481 transitions. [2024-11-19 00:51:27,507 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 481 transitions. Word has length 109 [2024-11-19 00:51:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:27,508 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 481 transitions. [2024-11-19 00:51:27,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 481 transitions. [2024-11-19 00:51:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:27,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:27,510 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:27,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:51:27,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:27,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1886655613, now seen corresponding path program 1 times [2024-11-19 00:51:27,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:27,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726832096] [2024-11-19 00:51:27,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:27,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:27,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726832096] [2024-11-19 00:51:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726832096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:51:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619103988] [2024-11-19 00:51:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:27,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:51:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:27,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:51:27,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:27,957 INFO L87 Difference]: Start difference. First operand 337 states and 481 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:28,177 INFO L93 Difference]: Finished difference Result 773 states and 1097 transitions. [2024-11-19 00:51:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:51:28,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-19 00:51:28,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:28,180 INFO L225 Difference]: With dead ends: 773 [2024-11-19 00:51:28,180 INFO L226 Difference]: Without dead ends: 439 [2024-11-19 00:51:28,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:51:28,182 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 77 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:28,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1054 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:28,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-19 00:51:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 343. [2024-11-19 00:51:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 303 states have (on average 1.372937293729373) internal successors, (416), 304 states have internal predecessors, (416), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:51:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 488 transitions. [2024-11-19 00:51:28,217 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 488 transitions. Word has length 109 [2024-11-19 00:51:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:28,219 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 488 transitions. [2024-11-19 00:51:28,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 488 transitions. [2024-11-19 00:51:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:28,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:28,222 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:28,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:51:28,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:28,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1746368490, now seen corresponding path program 1 times [2024-11-19 00:51:28,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:28,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888361477] [2024-11-19 00:51:28,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:28,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:29,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:29,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888361477] [2024-11-19 00:51:29,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888361477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:29,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:29,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:51:29,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558793072] [2024-11-19 00:51:29,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:29,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:51:29,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:29,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:51:29,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:51:29,578 INFO L87 Difference]: Start difference. First operand 343 states and 488 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:30,463 INFO L93 Difference]: Finished difference Result 713 states and 1010 transitions. [2024-11-19 00:51:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-19 00:51:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:30,467 INFO L225 Difference]: With dead ends: 713 [2024-11-19 00:51:30,467 INFO L226 Difference]: Without dead ends: 373 [2024-11-19 00:51:30,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:51:30,468 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 338 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:30,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 867 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:51:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-19 00:51:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 302. [2024-11-19 00:51:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 262 states have (on average 1.3625954198473282) internal successors, (357), 263 states have internal predecessors, (357), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:51:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 429 transitions. [2024-11-19 00:51:30,505 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 429 transitions. Word has length 109 [2024-11-19 00:51:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:30,505 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 429 transitions. [2024-11-19 00:51:30,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 429 transitions. [2024-11-19 00:51:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:30,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:30,507 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:30,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:51:30,507 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1424477971, now seen corresponding path program 1 times [2024-11-19 00:51:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136620194] [2024-11-19 00:51:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136620194] [2024-11-19 00:51:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136620194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:31,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:31,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:31,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005372778] [2024-11-19 00:51:31,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:31,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:31,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:31,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:31,728 INFO L87 Difference]: Start difference. First operand 302 states and 429 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 00:51:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:32,336 INFO L93 Difference]: Finished difference Result 706 states and 1003 transitions. [2024-11-19 00:51:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:51:32,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2024-11-19 00:51:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:32,341 INFO L225 Difference]: With dead ends: 706 [2024-11-19 00:51:32,342 INFO L226 Difference]: Without dead ends: 428 [2024-11-19 00:51:32,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:51:32,344 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 257 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:32,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 926 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:51:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-19 00:51:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 320. [2024-11-19 00:51:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 280 states have (on average 1.3714285714285714) internal successors, (384), 281 states have internal predecessors, (384), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:51:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 456 transitions. [2024-11-19 00:51:32,392 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 456 transitions. Word has length 109 [2024-11-19 00:51:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:32,392 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 456 transitions. [2024-11-19 00:51:32,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 00:51:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 456 transitions. [2024-11-19 00:51:32,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:32,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:32,394 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:32,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:51:32,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:32,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash 403409617, now seen corresponding path program 1 times [2024-11-19 00:51:32,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:32,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690544877] [2024-11-19 00:51:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:32,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:32,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690544877] [2024-11-19 00:51:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690544877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:32,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:51:32,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104662545] [2024-11-19 00:51:32,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:32,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:51:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:32,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:51:32,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:51:32,707 INFO L87 Difference]: Start difference. First operand 320 states and 456 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:32,969 INFO L93 Difference]: Finished difference Result 730 states and 1037 transitions. [2024-11-19 00:51:32,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:51:32,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-19 00:51:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:32,972 INFO L225 Difference]: With dead ends: 730 [2024-11-19 00:51:32,972 INFO L226 Difference]: Without dead ends: 434 [2024-11-19 00:51:32,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:32,974 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 186 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:32,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 616 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-19 00:51:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 338. [2024-11-19 00:51:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 298 states have (on average 1.3724832214765101) internal successors, (409), 299 states have internal predecessors, (409), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:51:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 481 transitions. [2024-11-19 00:51:33,006 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 481 transitions. Word has length 109 [2024-11-19 00:51:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:33,007 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 481 transitions. [2024-11-19 00:51:33,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2024-11-19 00:51:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:33,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:33,008 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:33,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:51:33,009 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:33,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1643332689, now seen corresponding path program 1 times [2024-11-19 00:51:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644844349] [2024-11-19 00:51:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:33,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:33,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644844349] [2024-11-19 00:51:33,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644844349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:33,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:33,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:51:33,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424867532] [2024-11-19 00:51:33,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:33,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:51:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:33,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:51:33,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:33,345 INFO L87 Difference]: Start difference. First operand 338 states and 481 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:33,648 INFO L93 Difference]: Finished difference Result 752 states and 1065 transitions. [2024-11-19 00:51:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:33,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-19 00:51:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:33,651 INFO L225 Difference]: With dead ends: 752 [2024-11-19 00:51:33,652 INFO L226 Difference]: Without dead ends: 438 [2024-11-19 00:51:33,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:51:33,654 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 494 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:33,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 438 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-19 00:51:33,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 344. [2024-11-19 00:51:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 304 states have (on average 1.368421052631579) internal successors, (416), 305 states have internal predecessors, (416), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:51:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 488 transitions. [2024-11-19 00:51:33,688 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 488 transitions. Word has length 109 [2024-11-19 00:51:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:33,692 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 488 transitions. [2024-11-19 00:51:33,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 488 transitions. [2024-11-19 00:51:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:51:33,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:33,694 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:33,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:51:33,695 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:33,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash 622264335, now seen corresponding path program 1 times [2024-11-19 00:51:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:33,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805404008] [2024-11-19 00:51:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:34,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805404008] [2024-11-19 00:51:34,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805404008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:34,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:51:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134558436] [2024-11-19 00:51:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:34,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:51:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:51:34,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:34,146 INFO L87 Difference]: Start difference. First operand 344 states and 488 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:34,404 INFO L93 Difference]: Finished difference Result 764 states and 1078 transitions. [2024-11-19 00:51:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:51:34,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-19 00:51:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:34,407 INFO L225 Difference]: With dead ends: 764 [2024-11-19 00:51:34,407 INFO L226 Difference]: Without dead ends: 444 [2024-11-19 00:51:34,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:51:34,409 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 77 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:34,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1242 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-19 00:51:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 350. [2024-11-19 00:51:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 310 states have (on average 1.364516129032258) internal successors, (423), 311 states have internal predecessors, (423), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:51:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 495 transitions. [2024-11-19 00:51:34,437 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 495 transitions. Word has length 109 [2024-11-19 00:51:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:34,438 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 495 transitions. [2024-11-19 00:51:34,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 495 transitions. [2024-11-19 00:51:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 00:51:34,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:34,439 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:34,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:51:34,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:34,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:34,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1648157893, now seen corresponding path program 1 times [2024-11-19 00:51:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:34,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675432959] [2024-11-19 00:51:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:34,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675432959] [2024-11-19 00:51:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675432959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:34,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:34,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:51:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776445382] [2024-11-19 00:51:34,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:34,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:34,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:34,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:34,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:51:34,646 INFO L87 Difference]: Start difference. First operand 350 states and 495 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:34,801 INFO L93 Difference]: Finished difference Result 817 states and 1149 transitions. [2024-11-19 00:51:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:34,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-19 00:51:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:34,804 INFO L225 Difference]: With dead ends: 817 [2024-11-19 00:51:34,804 INFO L226 Difference]: Without dead ends: 491 [2024-11-19 00:51:34,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:51:34,807 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 111 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:34,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 503 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-19 00:51:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 454. [2024-11-19 00:51:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 410 states have (on average 1.3634146341463416) internal successors, (559), 410 states have internal predecessors, (559), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 637 transitions. [2024-11-19 00:51:34,844 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 637 transitions. Word has length 111 [2024-11-19 00:51:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:34,844 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 637 transitions. [2024-11-19 00:51:34,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 637 transitions. [2024-11-19 00:51:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 00:51:34,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:34,846 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:34,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:51:34,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:34,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash 898144979, now seen corresponding path program 1 times [2024-11-19 00:51:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546005969] [2024-11-19 00:51:34,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 00:51:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546005969] [2024-11-19 00:51:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546005969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:51:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171931581] [2024-11-19 00:51:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:34,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:51:34,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:51:34,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:51:34,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:51:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:35,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:51:35,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:51:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:35,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:51:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171931581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:35,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:51:35,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:51:35,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062842892] [2024-11-19 00:51:35,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:35,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:35,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:35,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:35,200 INFO L87 Difference]: Start difference. First operand 454 states and 637 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:35,264 INFO L93 Difference]: Finished difference Result 786 states and 1106 transitions. [2024-11-19 00:51:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:35,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-19 00:51:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:35,267 INFO L225 Difference]: With dead ends: 786 [2024-11-19 00:51:35,267 INFO L226 Difference]: Without dead ends: 460 [2024-11-19 00:51:35,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:35,269 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:35,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:51:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-19 00:51:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2024-11-19 00:51:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 416 states have (on average 1.3581730769230769) internal successors, (565), 416 states have internal predecessors, (565), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 643 transitions. [2024-11-19 00:51:35,313 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 643 transitions. Word has length 111 [2024-11-19 00:51:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:35,313 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 643 transitions. [2024-11-19 00:51:35,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 643 transitions. [2024-11-19 00:51:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:51:35,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:35,314 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:35,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:51:35,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 00:51:35,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:35,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1149193064, now seen corresponding path program 1 times [2024-11-19 00:51:35,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:35,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418197995] [2024-11-19 00:51:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:35,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:36,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418197995] [2024-11-19 00:51:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418197995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:36,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 00:51:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874847239] [2024-11-19 00:51:36,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:36,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:51:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:36,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:51:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:51:36,884 INFO L87 Difference]: Start difference. First operand 460 states and 643 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 00:51:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:37,867 INFO L93 Difference]: Finished difference Result 1079 states and 1507 transitions. [2024-11-19 00:51:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:51:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2024-11-19 00:51:37,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:37,872 INFO L225 Difference]: With dead ends: 1079 [2024-11-19 00:51:37,872 INFO L226 Difference]: Without dead ends: 747 [2024-11-19 00:51:37,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:51:37,876 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 421 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:37,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1154 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:51:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-11-19 00:51:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 474. [2024-11-19 00:51:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 430 states have (on average 1.3790697674418604) internal successors, (593), 430 states have internal predecessors, (593), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 671 transitions. [2024-11-19 00:51:37,919 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 671 transitions. Word has length 112 [2024-11-19 00:51:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:37,919 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 671 transitions. [2024-11-19 00:51:37,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 00:51:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 671 transitions. [2024-11-19 00:51:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:51:37,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:37,921 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:37,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:51:37,922 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:37,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:37,922 INFO L85 PathProgramCache]: Analyzing trace with hash 128124710, now seen corresponding path program 1 times [2024-11-19 00:51:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:37,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287380183] [2024-11-19 00:51:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:37,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:38,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287380183] [2024-11-19 00:51:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287380183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:38,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:51:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652631498] [2024-11-19 00:51:38,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:38,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:51:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:38,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:51:38,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:51:38,434 INFO L87 Difference]: Start difference. First operand 474 states and 671 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:38,735 INFO L93 Difference]: Finished difference Result 942 states and 1327 transitions. [2024-11-19 00:51:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:51:38,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 112 [2024-11-19 00:51:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:38,738 INFO L225 Difference]: With dead ends: 942 [2024-11-19 00:51:38,738 INFO L226 Difference]: Without dead ends: 589 [2024-11-19 00:51:38,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:51:38,741 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 179 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:38,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 515 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-19 00:51:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 480. [2024-11-19 00:51:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 436 states have (on average 1.3807339449541285) internal successors, (602), 436 states have internal predecessors, (602), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 680 transitions. [2024-11-19 00:51:38,777 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 680 transitions. Word has length 112 [2024-11-19 00:51:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:38,778 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 680 transitions. [2024-11-19 00:51:38,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 680 transitions. [2024-11-19 00:51:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:51:38,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:38,779 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:38,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:51:38,779 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:38,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash 268673320, now seen corresponding path program 1 times [2024-11-19 00:51:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097677605] [2024-11-19 00:51:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097677605] [2024-11-19 00:51:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097677605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:38,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:38,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:51:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321708284] [2024-11-19 00:51:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:38,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:38,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:38,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:51:38,982 INFO L87 Difference]: Start difference. First operand 480 states and 680 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:39,107 INFO L93 Difference]: Finished difference Result 936 states and 1317 transitions. [2024-11-19 00:51:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:51:39,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 112 [2024-11-19 00:51:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:39,110 INFO L225 Difference]: With dead ends: 936 [2024-11-19 00:51:39,111 INFO L226 Difference]: Without dead ends: 527 [2024-11-19 00:51:39,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:51:39,112 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 65 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:39,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 666 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-19 00:51:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 427. [2024-11-19 00:51:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 383 states have (on average 1.3420365535248042) internal successors, (514), 383 states have internal predecessors, (514), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 592 transitions. [2024-11-19 00:51:39,148 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 592 transitions. Word has length 112 [2024-11-19 00:51:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:39,148 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 592 transitions. [2024-11-19 00:51:39,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 592 transitions. [2024-11-19 00:51:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:51:39,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:39,150 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:39,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 00:51:39,151 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:39,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1011594872, now seen corresponding path program 1 times [2024-11-19 00:51:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:39,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401812230] [2024-11-19 00:51:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:40,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:40,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401812230] [2024-11-19 00:51:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401812230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:40,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:40,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 00:51:40,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878808769] [2024-11-19 00:51:40,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:40,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:51:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:40,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:51:40,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:51:40,096 INFO L87 Difference]: Start difference. First operand 427 states and 592 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:40,689 INFO L93 Difference]: Finished difference Result 874 states and 1198 transitions. [2024-11-19 00:51:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:51:40,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2024-11-19 00:51:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:40,692 INFO L225 Difference]: With dead ends: 874 [2024-11-19 00:51:40,692 INFO L226 Difference]: Without dead ends: 562 [2024-11-19 00:51:40,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:51:40,694 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 461 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:40,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 910 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:51:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-19 00:51:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 421. [2024-11-19 00:51:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 377 states have (on average 1.3501326259946949) internal successors, (509), 377 states have internal predecessors, (509), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 587 transitions. [2024-11-19 00:51:40,740 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 587 transitions. Word has length 112 [2024-11-19 00:51:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:40,740 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 587 transitions. [2024-11-19 00:51:40,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 587 transitions. [2024-11-19 00:51:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:51:40,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:40,742 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:40,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 00:51:40,742 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:40,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2032663226, now seen corresponding path program 1 times [2024-11-19 00:51:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:40,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470101822] [2024-11-19 00:51:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:40,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:41,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470101822] [2024-11-19 00:51:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470101822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:41,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:41,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:51:41,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797713123] [2024-11-19 00:51:41,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:41,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:51:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:41,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:51:41,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:41,228 INFO L87 Difference]: Start difference. First operand 421 states and 587 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:41,543 INFO L93 Difference]: Finished difference Result 849 states and 1178 transitions. [2024-11-19 00:51:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:51:41,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2024-11-19 00:51:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:41,546 INFO L225 Difference]: With dead ends: 849 [2024-11-19 00:51:41,546 INFO L226 Difference]: Without dead ends: 536 [2024-11-19 00:51:41,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:41,548 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 347 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:41,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 514 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-19 00:51:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 427. [2024-11-19 00:51:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 383 states have (on average 1.3524804177545693) internal successors, (518), 383 states have internal predecessors, (518), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 596 transitions. [2024-11-19 00:51:41,590 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 596 transitions. Word has length 112 [2024-11-19 00:51:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:41,590 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 596 transitions. [2024-11-19 00:51:41,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 596 transitions. [2024-11-19 00:51:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:51:41,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:41,592 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:41,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 00:51:41,592 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:41,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1892114616, now seen corresponding path program 1 times [2024-11-19 00:51:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:41,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169567008] [2024-11-19 00:51:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169567008] [2024-11-19 00:51:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169567008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:41,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:51:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915048029] [2024-11-19 00:51:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:41,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:51:41,772 INFO L87 Difference]: Start difference. First operand 427 states and 596 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:41,905 INFO L93 Difference]: Finished difference Result 817 states and 1129 transitions. [2024-11-19 00:51:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:51:41,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 112 [2024-11-19 00:51:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:41,909 INFO L225 Difference]: With dead ends: 817 [2024-11-19 00:51:41,909 INFO L226 Difference]: Without dead ends: 483 [2024-11-19 00:51:41,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:51:41,913 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 65 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:41,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 666 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:41,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-19 00:51:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 377. [2024-11-19 00:51:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 333 states have (on average 1.3333333333333333) internal successors, (444), 333 states have internal predecessors, (444), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2024-11-19 00:51:41,958 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 112 [2024-11-19 00:51:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:41,958 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2024-11-19 00:51:41,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2024-11-19 00:51:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:51:41,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:41,959 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:41,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 00:51:41,960 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash 15762643, now seen corresponding path program 1 times [2024-11-19 00:51:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:41,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224132711] [2024-11-19 00:51:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:41,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224132711] [2024-11-19 00:51:42,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224132711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:42,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:42,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:51:42,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611771022] [2024-11-19 00:51:42,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:42,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:51:42,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:42,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:51:42,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:51:42,393 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:42,562 INFO L93 Difference]: Finished difference Result 389 states and 534 transitions. [2024-11-19 00:51:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:42,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-11-19 00:51:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:42,565 INFO L225 Difference]: With dead ends: 389 [2024-11-19 00:51:42,565 INFO L226 Difference]: Without dead ends: 387 [2024-11-19 00:51:42,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:51:42,566 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 97 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:42,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 828 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-19 00:51:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2024-11-19 00:51:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 342 states have (on average 1.3245614035087718) internal successors, (453), 342 states have internal predecessors, (453), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 531 transitions. [2024-11-19 00:51:42,605 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 531 transitions. Word has length 113 [2024-11-19 00:51:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:42,606 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 531 transitions. [2024-11-19 00:51:42,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 531 transitions. [2024-11-19 00:51:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:51:42,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:42,608 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:42,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 00:51:42,608 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash 17609685, now seen corresponding path program 1 times [2024-11-19 00:51:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875961107] [2024-11-19 00:51:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:43,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875961107] [2024-11-19 00:51:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875961107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:43,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:43,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:51:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955357916] [2024-11-19 00:51:43,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:43,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:51:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:43,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:51:43,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:51:43,203 INFO L87 Difference]: Start difference. First operand 387 states and 531 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:43,555 INFO L93 Difference]: Finished difference Result 686 states and 937 transitions. [2024-11-19 00:51:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:51:43,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-11-19 00:51:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:43,558 INFO L225 Difference]: With dead ends: 686 [2024-11-19 00:51:43,558 INFO L226 Difference]: Without dead ends: 395 [2024-11-19 00:51:43,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:51:43,560 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 233 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:43,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 624 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-19 00:51:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-19 00:51:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 348 states have (on average 1.3132183908045978) internal successors, (457), 348 states have internal predecessors, (457), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 535 transitions. [2024-11-19 00:51:43,601 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 535 transitions. Word has length 113 [2024-11-19 00:51:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:43,602 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 535 transitions. [2024-11-19 00:51:43,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:43,602 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 535 transitions. [2024-11-19 00:51:43,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:51:43,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:43,604 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:43,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 00:51:43,604 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:43,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:43,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1792617047, now seen corresponding path program 1 times [2024-11-19 00:51:43,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:43,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230252711] [2024-11-19 00:51:43,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:43,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:43,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230252711] [2024-11-19 00:51:43,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230252711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:43,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:43,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:51:43,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477082093] [2024-11-19 00:51:43,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:43,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:43,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:51:43,815 INFO L87 Difference]: Start difference. First operand 395 states and 535 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:43,942 INFO L93 Difference]: Finished difference Result 694 states and 939 transitions. [2024-11-19 00:51:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:43,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-11-19 00:51:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:43,947 INFO L225 Difference]: With dead ends: 694 [2024-11-19 00:51:43,948 INFO L226 Difference]: Without dead ends: 395 [2024-11-19 00:51:43,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:51:43,952 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 87 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:43,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 498 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:51:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-19 00:51:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-19 00:51:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 348 states have (on average 1.3074712643678161) internal successors, (455), 348 states have internal predecessors, (455), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 533 transitions. [2024-11-19 00:51:44,013 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 533 transitions. Word has length 113 [2024-11-19 00:51:44,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:44,013 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 533 transitions. [2024-11-19 00:51:44,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 533 transitions. [2024-11-19 00:51:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:51:44,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:44,014 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:44,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 00:51:44,015 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:44,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1822291879, now seen corresponding path program 1 times [2024-11-19 00:51:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225206534] [2024-11-19 00:51:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 00:51:44,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225206534] [2024-11-19 00:51:44,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225206534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:51:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738608472] [2024-11-19 00:51:44,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:44,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:51:44,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:51:44,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:51:44,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:51:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:44,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:51:44,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:51:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:44,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:51:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738608472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:44,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:51:44,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:51:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284198862] [2024-11-19 00:51:44,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:44,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:44,359 INFO L87 Difference]: Start difference. First operand 395 states and 533 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:44,417 INFO L93 Difference]: Finished difference Result 700 states and 943 transitions. [2024-11-19 00:51:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:44,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-11-19 00:51:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:44,420 INFO L225 Difference]: With dead ends: 700 [2024-11-19 00:51:44,420 INFO L226 Difference]: Without dead ends: 401 [2024-11-19 00:51:44,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:44,421 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:44,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:51:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-19 00:51:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-11-19 00:51:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 354 states have (on average 1.3022598870056497) internal successors, (461), 354 states have internal predecessors, (461), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 539 transitions. [2024-11-19 00:51:44,465 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 539 transitions. Word has length 113 [2024-11-19 00:51:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:44,465 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 539 transitions. [2024-11-19 00:51:44,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 539 transitions. [2024-11-19 00:51:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:51:44,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:44,466 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:44,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:51:44,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:51:44,667 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:44,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash 310078142, now seen corresponding path program 1 times [2024-11-19 00:51:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346823380] [2024-11-19 00:51:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 00:51:44,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:44,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346823380] [2024-11-19 00:51:44,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346823380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:51:44,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789200616] [2024-11-19 00:51:44,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:44,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:51:44,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:51:44,800 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:51:44,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:51:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:44,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:51:44,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:51:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:45,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:51:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789200616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:45,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:51:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-19 00:51:45,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454613072] [2024-11-19 00:51:45,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:45,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:51:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:51:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:51:45,020 INFO L87 Difference]: Start difference. First operand 401 states and 539 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:45,094 INFO L93 Difference]: Finished difference Result 714 states and 957 transitions. [2024-11-19 00:51:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:51:45,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2024-11-19 00:51:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:45,096 INFO L225 Difference]: With dead ends: 714 [2024-11-19 00:51:45,096 INFO L226 Difference]: Without dead ends: 409 [2024-11-19 00:51:45,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:51:45,098 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:45,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 665 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:51:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-19 00:51:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2024-11-19 00:51:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 356 states have (on average 1.300561797752809) internal successors, (463), 356 states have internal predecessors, (463), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 541 transitions. [2024-11-19 00:51:45,139 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 541 transitions. Word has length 116 [2024-11-19 00:51:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:45,139 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 541 transitions. [2024-11-19 00:51:45,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 541 transitions. [2024-11-19 00:51:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:51:45,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:45,140 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:45,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:51:45,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 00:51:45,341 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:45,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:45,341 INFO L85 PathProgramCache]: Analyzing trace with hash 211762456, now seen corresponding path program 1 times [2024-11-19 00:51:45,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:45,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431633230] [2024-11-19 00:51:45,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:45,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:45,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:45,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431633230] [2024-11-19 00:51:45,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431633230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:45,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:51:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739518210] [2024-11-19 00:51:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:45,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:51:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:45,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:51:45,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:51:45,755 INFO L87 Difference]: Start difference. First operand 403 states and 541 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:45,952 INFO L93 Difference]: Finished difference Result 714 states and 955 transitions. [2024-11-19 00:51:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:45,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-19 00:51:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:45,955 INFO L225 Difference]: With dead ends: 714 [2024-11-19 00:51:45,955 INFO L226 Difference]: Without dead ends: 407 [2024-11-19 00:51:45,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:45,956 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 117 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:45,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 563 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-19 00:51:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 403. [2024-11-19 00:51:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 356 states have (on average 1.297752808988764) internal successors, (462), 356 states have internal predecessors, (462), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 540 transitions. [2024-11-19 00:51:45,999 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 540 transitions. Word has length 118 [2024-11-19 00:51:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:45,999 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 540 transitions. [2024-11-19 00:51:45,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:51:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 540 transitions. [2024-11-19 00:51:46,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:51:46,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:46,001 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:46,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 00:51:46,001 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:46,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:46,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1656840533, now seen corresponding path program 1 times [2024-11-19 00:51:46,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:46,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792288583] [2024-11-19 00:51:46,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:46,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:46,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:46,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792288583] [2024-11-19 00:51:46,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792288583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:46,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:51:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968698719] [2024-11-19 00:51:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:46,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:51:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:46,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:51:46,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:46,481 INFO L87 Difference]: Start difference. First operand 403 states and 540 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:46,842 INFO L93 Difference]: Finished difference Result 739 states and 978 transitions. [2024-11-19 00:51:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:51:46,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2024-11-19 00:51:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:46,845 INFO L225 Difference]: With dead ends: 739 [2024-11-19 00:51:46,845 INFO L226 Difference]: Without dead ends: 432 [2024-11-19 00:51:46,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:51:46,846 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 457 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:46,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 541 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-19 00:51:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2024-11-19 00:51:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 359 states have (on average 1.2896935933147633) internal successors, (463), 359 states have internal predecessors, (463), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 541 transitions. [2024-11-19 00:51:46,893 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 541 transitions. Word has length 122 [2024-11-19 00:51:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:46,894 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 541 transitions. [2024-11-19 00:51:46,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 541 transitions. [2024-11-19 00:51:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:51:46,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:46,895 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:46,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 00:51:46,895 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:46,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1999509487, now seen corresponding path program 1 times [2024-11-19 00:51:46,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:46,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534396022] [2024-11-19 00:51:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:46,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:47,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:47,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534396022] [2024-11-19 00:51:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534396022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:47,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:47,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:51:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663069441] [2024-11-19 00:51:47,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:47,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:51:47,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:47,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:51:47,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:51:47,322 INFO L87 Difference]: Start difference. First operand 407 states and 541 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:47,615 INFO L93 Difference]: Finished difference Result 739 states and 974 transitions. [2024-11-19 00:51:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:51:47,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2024-11-19 00:51:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:47,619 INFO L225 Difference]: With dead ends: 739 [2024-11-19 00:51:47,619 INFO L226 Difference]: Without dead ends: 432 [2024-11-19 00:51:47,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:51:47,621 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 199 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:47,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 478 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-19 00:51:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2024-11-19 00:51:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 359 states have (on average 1.2841225626740946) internal successors, (461), 359 states have internal predecessors, (461), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 539 transitions. [2024-11-19 00:51:47,670 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 539 transitions. Word has length 123 [2024-11-19 00:51:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:47,670 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 539 transitions. [2024-11-19 00:51:47,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 539 transitions. [2024-11-19 00:51:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 00:51:47,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:47,672 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:47,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 00:51:47,672 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:47,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:47,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1268947704, now seen corresponding path program 1 times [2024-11-19 00:51:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:47,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916091844] [2024-11-19 00:51:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916091844] [2024-11-19 00:51:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916091844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:51:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001342925] [2024-11-19 00:51:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:48,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:51:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:51:48,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:51:48,247 INFO L87 Difference]: Start difference. First operand 407 states and 539 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:48,579 INFO L93 Difference]: Finished difference Result 739 states and 970 transitions. [2024-11-19 00:51:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:51:48,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 124 [2024-11-19 00:51:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:48,582 INFO L225 Difference]: With dead ends: 739 [2024-11-19 00:51:48,583 INFO L226 Difference]: Without dead ends: 432 [2024-11-19 00:51:48,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:51:48,584 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 255 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:48,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 580 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-19 00:51:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2024-11-19 00:51:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 359 states have (on average 1.2785515320334262) internal successors, (459), 359 states have internal predecessors, (459), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 537 transitions. [2024-11-19 00:51:48,645 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 537 transitions. Word has length 124 [2024-11-19 00:51:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:48,645 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 537 transitions. [2024-11-19 00:51:48,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 537 transitions. [2024-11-19 00:51:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:51:48,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:48,646 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:48,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 00:51:48,647 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:48,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1094508302, now seen corresponding path program 1 times [2024-11-19 00:51:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497331899] [2024-11-19 00:51:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 00:51:49,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497331899] [2024-11-19 00:51:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497331899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:51:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018317471] [2024-11-19 00:51:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:49,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:51:49,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:51:49,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:51:49,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:51:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:49,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 00:51:49,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:51:50,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:51:50,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:51:50,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 00:51:50,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2024-11-19 00:51:50,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2024-11-19 00:51:50,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2024-11-19 00:51:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 00:51:50,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:51:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018317471] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:51:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:51:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 7] total 20 [2024-11-19 00:51:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915231028] [2024-11-19 00:51:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:50,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:51:50,942 INFO L87 Difference]: Start difference. First operand 407 states and 537 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:51,119 INFO L93 Difference]: Finished difference Result 867 states and 1119 transitions. [2024-11-19 00:51:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:51,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 126 [2024-11-19 00:51:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:51,122 INFO L225 Difference]: With dead ends: 867 [2024-11-19 00:51:51,122 INFO L226 Difference]: Without dead ends: 560 [2024-11-19 00:51:51,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:51:51,124 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 51 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:51,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 524 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-19 00:51:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 482. [2024-11-19 00:51:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 434 states have (on average 1.26036866359447) internal successors, (547), 434 states have internal predecessors, (547), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 625 transitions. [2024-11-19 00:51:51,175 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 625 transitions. Word has length 126 [2024-11-19 00:51:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:51,175 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 625 transitions. [2024-11-19 00:51:51,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 625 transitions. [2024-11-19 00:51:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:51:51,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:51,177 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:51,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:51:51,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:51:51,377 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:51,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash 855105044, now seen corresponding path program 1 times [2024-11-19 00:51:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507147102] [2024-11-19 00:51:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:51,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:51,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507147102] [2024-11-19 00:51:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507147102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:51:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598716561] [2024-11-19 00:51:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:51:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:51,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:51:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:51:51,682 INFO L87 Difference]: Start difference. First operand 482 states and 625 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:51,858 INFO L93 Difference]: Finished difference Result 1121 states and 1420 transitions. [2024-11-19 00:51:51,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:51:51,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2024-11-19 00:51:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:51,862 INFO L225 Difference]: With dead ends: 1121 [2024-11-19 00:51:51,862 INFO L226 Difference]: Without dead ends: 756 [2024-11-19 00:51:51,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:51:51,863 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 142 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:51,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 492 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-19 00:51:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 567. [2024-11-19 00:51:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 519 states have (on average 1.2504816955684008) internal successors, (649), 519 states have internal predecessors, (649), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 727 transitions. [2024-11-19 00:51:51,918 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 727 transitions. Word has length 128 [2024-11-19 00:51:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:51,918 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 727 transitions. [2024-11-19 00:51:51,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 727 transitions. [2024-11-19 00:51:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:51:51,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:51,919 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:51,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 00:51:51,920 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:51,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:51,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1514636566, now seen corresponding path program 1 times [2024-11-19 00:51:51,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:51,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098925493] [2024-11-19 00:51:51,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:51,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:52,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098925493] [2024-11-19 00:51:52,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098925493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:52,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:52,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:51:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021565242] [2024-11-19 00:51:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:52,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:51:52,118 INFO L87 Difference]: Start difference. First operand 567 states and 727 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:52,263 INFO L93 Difference]: Finished difference Result 1106 states and 1406 transitions. [2024-11-19 00:51:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:51:52,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2024-11-19 00:51:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:52,267 INFO L225 Difference]: With dead ends: 1106 [2024-11-19 00:51:52,267 INFO L226 Difference]: Without dead ends: 675 [2024-11-19 00:51:52,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:51:52,269 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 35 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:52,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 539 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-19 00:51:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 623. [2024-11-19 00:51:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 575 states have (on average 1.2452173913043478) internal successors, (716), 575 states have internal predecessors, (716), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 794 transitions. [2024-11-19 00:51:52,322 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 794 transitions. Word has length 128 [2024-11-19 00:51:52,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:52,322 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 794 transitions. [2024-11-19 00:51:52,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 794 transitions. [2024-11-19 00:51:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:51:52,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:52,324 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:52,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 00:51:52,324 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:52,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:52,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1776312839, now seen corresponding path program 1 times [2024-11-19 00:51:52,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:52,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092808844] [2024-11-19 00:51:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:52,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:52,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092808844] [2024-11-19 00:51:52,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092808844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:52,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:52,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:51:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81738744] [2024-11-19 00:51:52,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:52,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:51:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:51:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:51:52,701 INFO L87 Difference]: Start difference. First operand 623 states and 794 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:52,993 INFO L93 Difference]: Finished difference Result 1249 states and 1587 transitions. [2024-11-19 00:51:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:52,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 129 [2024-11-19 00:51:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:52,997 INFO L225 Difference]: With dead ends: 1249 [2024-11-19 00:51:52,997 INFO L226 Difference]: Without dead ends: 772 [2024-11-19 00:51:52,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:51:52,999 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 363 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:52,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 647 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:51:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-19 00:51:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 652. [2024-11-19 00:51:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 604 states have (on average 1.2516556291390728) internal successors, (756), 604 states have internal predecessors, (756), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 834 transitions. [2024-11-19 00:51:53,058 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 834 transitions. Word has length 129 [2024-11-19 00:51:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:53,058 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 834 transitions. [2024-11-19 00:51:53,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 834 transitions. [2024-11-19 00:51:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 00:51:53,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:53,060 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:53,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 00:51:53,060 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:53,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1874605513, now seen corresponding path program 1 times [2024-11-19 00:51:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448309978] [2024-11-19 00:51:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:53,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:53,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448309978] [2024-11-19 00:51:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448309978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:51:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917144602] [2024-11-19 00:51:53,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:53,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:51:53,158 INFO L87 Difference]: Start difference. First operand 652 states and 834 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:53,327 INFO L93 Difference]: Finished difference Result 1329 states and 1701 transitions. [2024-11-19 00:51:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:53,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 132 [2024-11-19 00:51:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:53,331 INFO L225 Difference]: With dead ends: 1329 [2024-11-19 00:51:53,331 INFO L226 Difference]: Without dead ends: 819 [2024-11-19 00:51:53,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:51:53,332 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 63 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:53,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 642 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-19 00:51:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 670. [2024-11-19 00:51:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 622 states have (on average 1.2636655948553055) internal successors, (786), 622 states have internal predecessors, (786), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 864 transitions. [2024-11-19 00:51:53,385 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 864 transitions. Word has length 132 [2024-11-19 00:51:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:53,386 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 864 transitions. [2024-11-19 00:51:53,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 864 transitions. [2024-11-19 00:51:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:51:53,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:53,387 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:53,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 00:51:53,387 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:53,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1990734427, now seen corresponding path program 1 times [2024-11-19 00:51:53,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:53,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443187706] [2024-11-19 00:51:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:53,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443187706] [2024-11-19 00:51:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443187706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:53,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:51:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979713860] [2024-11-19 00:51:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:51:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:53,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:51:53,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:51:53,472 INFO L87 Difference]: Start difference. First operand 670 states and 864 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:53,621 INFO L93 Difference]: Finished difference Result 1361 states and 1753 transitions. [2024-11-19 00:51:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:51:53,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 133 [2024-11-19 00:51:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:53,624 INFO L225 Difference]: With dead ends: 1361 [2024-11-19 00:51:53,624 INFO L226 Difference]: Without dead ends: 837 [2024-11-19 00:51:53,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:51:53,626 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 63 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:53,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 653 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-11-19 00:51:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 670. [2024-11-19 00:51:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 622 states have (on average 1.2636655948553055) internal successors, (786), 622 states have internal predecessors, (786), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 864 transitions. [2024-11-19 00:51:53,686 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 864 transitions. Word has length 133 [2024-11-19 00:51:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:53,686 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 864 transitions. [2024-11-19 00:51:53,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 864 transitions. [2024-11-19 00:51:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:51:53,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:53,687 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:53,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 00:51:53,688 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:53,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2009906548, now seen corresponding path program 1 times [2024-11-19 00:51:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661906088] [2024-11-19 00:51:53,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:54,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:54,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661906088] [2024-11-19 00:51:54,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661906088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:54,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:54,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:51:54,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372470513] [2024-11-19 00:51:54,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:54,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:51:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:51:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:51:54,033 INFO L87 Difference]: Start difference. First operand 670 states and 864 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:54,254 INFO L93 Difference]: Finished difference Result 1197 states and 1539 transitions. [2024-11-19 00:51:54,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:54,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 134 [2024-11-19 00:51:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:54,258 INFO L225 Difference]: With dead ends: 1197 [2024-11-19 00:51:54,258 INFO L226 Difference]: Without dead ends: 652 [2024-11-19 00:51:54,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:51:54,260 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 119 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:54,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 557 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-19 00:51:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2024-11-19 00:51:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 604 states have (on average 1.2218543046357615) internal successors, (738), 604 states have internal predecessors, (738), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 816 transitions. [2024-11-19 00:51:54,347 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 816 transitions. Word has length 134 [2024-11-19 00:51:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:54,347 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 816 transitions. [2024-11-19 00:51:54,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 816 transitions. [2024-11-19 00:51:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:51:54,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:54,349 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:54,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 00:51:54,350 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:54,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1690932808, now seen corresponding path program 1 times [2024-11-19 00:51:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:54,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87380259] [2024-11-19 00:51:54,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:54,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87380259] [2024-11-19 00:51:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87380259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:54,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:54,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:51:54,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022971988] [2024-11-19 00:51:54,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:54,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:51:54,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:54,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:51:54,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:51:54,754 INFO L87 Difference]: Start difference. First operand 652 states and 816 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:54,974 INFO L93 Difference]: Finished difference Result 1317 states and 1640 transitions. [2024-11-19 00:51:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:51:54,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 136 [2024-11-19 00:51:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:54,979 INFO L225 Difference]: With dead ends: 1317 [2024-11-19 00:51:54,979 INFO L226 Difference]: Without dead ends: 799 [2024-11-19 00:51:54,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:51:54,980 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 205 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:54,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 481 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:51:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-19 00:51:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 659. [2024-11-19 00:51:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 611 states have (on average 1.2176759410801965) internal successors, (744), 611 states have internal predecessors, (744), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 822 transitions. [2024-11-19 00:51:55,042 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 822 transitions. Word has length 136 [2024-11-19 00:51:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:55,042 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 822 transitions. [2024-11-19 00:51:55,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 822 transitions. [2024-11-19 00:51:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:51:55,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:55,043 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:51:55,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 00:51:55,044 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:55,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1031401286, now seen corresponding path program 1 times [2024-11-19 00:51:55,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:55,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467004461] [2024-11-19 00:51:55,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:51:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:51:55,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:51:55,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467004461] [2024-11-19 00:51:55,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467004461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:51:55,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:51:55,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 00:51:55,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022208049] [2024-11-19 00:51:55,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:51:55,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:51:55,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:51:55,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:51:55,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:51:55,798 INFO L87 Difference]: Start difference. First operand 659 states and 822 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:51:56,353 INFO L93 Difference]: Finished difference Result 1318 states and 1621 transitions. [2024-11-19 00:51:56,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 00:51:56,353 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 136 [2024-11-19 00:51:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:51:56,356 INFO L225 Difference]: With dead ends: 1318 [2024-11-19 00:51:56,356 INFO L226 Difference]: Without dead ends: 806 [2024-11-19 00:51:56,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 00:51:56,358 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 173 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:51:56,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 2081 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:51:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-19 00:51:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 656. [2024-11-19 00:51:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 608 states have (on average 1.2171052631578947) internal successors, (740), 608 states have internal predecessors, (740), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 00:51:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 818 transitions. [2024-11-19 00:51:56,415 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 818 transitions. Word has length 136 [2024-11-19 00:51:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:51:56,416 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 818 transitions. [2024-11-19 00:51:56,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:51:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 818 transitions. [2024-11-19 00:51:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-19 00:51:56,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:51:56,418 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 00:51:56,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-19 00:51:56,419 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:51:56,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:51:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash -126764528, now seen corresponding path program 1 times [2024-11-19 00:51:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:51:56,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024499160] [2024-11-19 00:51:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:51:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:51:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat