./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX --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 ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:47:05,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:47:05,956 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:47:05,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:47:05,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:47:05,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:47:05,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:47:06,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:47:06,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:47:06,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:47:06,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:47:06,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:47:06,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:47:06,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:47:06,003 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:47:06,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:47:06,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:47:06,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:47:06,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:47:06,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:47:06,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:47:06,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:47:06,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:47:06,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:47:06,007 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:47:06,008 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:47:06,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:47:06,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:47:06,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:47:06,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:47:06,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:47:06,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:47:06,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:47:06,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:47:06,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:47:06,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:47:06,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:47:06,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:47:06,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:47:06,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:47:06,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:47:06,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:47:06,016 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX 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 -> ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a [2024-11-08 18:47:06,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:47:06,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:47:06,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:47:06,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:47:06,348 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:47:06,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i Unable to find full path for "g++" [2024-11-08 18:47:08,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:47:08,654 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:47:08,655 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2024-11-08 18:47:08,674 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/data/2f2278495/e6664fa0eaca4c069327d49695b29329/FLAGadc054005 [2024-11-08 18:47:09,036 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/data/2f2278495/e6664fa0eaca4c069327d49695b29329 [2024-11-08 18:47:09,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:47:09,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:47:09,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:47:09,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:47:09,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:47:09,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c575a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09, skipping insertion in model container [2024-11-08 18:47:09,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:47:09,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i[919,932] [2024-11-08 18:47:09,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:47:09,386 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:47:09,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i[919,932] [2024-11-08 18:47:09,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:47:09,450 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:47:09,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09 WrapperNode [2024-11-08 18:47:09,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:47:09,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:47:09,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:47:09,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:47:09,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,524 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-08 18:47:09,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:47:09,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:47:09,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:47:09,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:47:09,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,575 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:47:09,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:47:09,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:47:09,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:47:09,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:47:09,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (1/1) ... [2024-11-08 18:47:09,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:47:09,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:47:09,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:47:09,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:47:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:47:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:47:09,689 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:47:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:47:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:47:09,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:47:09,792 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:47:09,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:47:10,298 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 18:47:10,299 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:47:10,315 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:47:10,315 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:47:10,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:47:10 BoogieIcfgContainer [2024-11-08 18:47:10,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:47:10,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:47:10,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:47:10,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:47:10,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:47:09" (1/3) ... [2024-11-08 18:47:10,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9fe3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:47:10, skipping insertion in model container [2024-11-08 18:47:10,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:47:09" (2/3) ... [2024-11-08 18:47:10,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9fe3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:47:10, skipping insertion in model container [2024-11-08 18:47:10,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:47:10" (3/3) ... [2024-11-08 18:47:10,330 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-34.i [2024-11-08 18:47:10,350 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:47:10,350 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:47:10,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:47:10,426 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;@65a69648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:47:10,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:47:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 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-08 18:47:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 18:47:10,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:10,443 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] [2024-11-08 18:47:10,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:10,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash -211424365, now seen corresponding path program 1 times [2024-11-08 18:47:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:47:10,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539506208] [2024-11-08 18:47:10,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:10,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:47:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:47:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:47:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:47:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:47:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:47:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:47:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:47:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:47:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:47:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:47:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:47:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:47:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:47:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:10,912 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-08 18:47:10,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:47:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539506208] [2024-11-08 18:47:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539506208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:47:10,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:47:10,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:47:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538989573] [2024-11-08 18:47:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:47:10,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:47:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:47:10,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:47:10,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:47:10,960 INFO L87 Difference]: Start difference. First operand has 69 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 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-08 18:47:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:10,998 INFO L93 Difference]: Finished difference Result 131 states and 219 transitions. [2024-11-08 18:47:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:47:11,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 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 92 [2024-11-08 18:47:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:11,011 INFO L225 Difference]: With dead ends: 131 [2024-11-08 18:47:11,011 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 18:47:11,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-08 18:47:11,021 INFO L432 NwaCegarLoop]: 99 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, 99 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-08 18:47:11,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:47:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 18:47:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-08 18:47:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 50 states have internal predecessors, (73), 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-08 18:47:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2024-11-08 18:47:11,083 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 92 [2024-11-08 18:47:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:11,084 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2024-11-08 18:47:11,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 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-08 18:47:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2024-11-08 18:47:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 18:47:11,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:11,092 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] [2024-11-08 18:47:11,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:47:11,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:11,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:11,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2112462485, now seen corresponding path program 1 times [2024-11-08 18:47:11,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:47:11,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495327590] [2024-11-08 18:47:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:47:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:47:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:47:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:47:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:47:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:47:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:47:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:47:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:47:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:47:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:47:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:47:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:47:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:47:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:11,759 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-08 18:47:11,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:47:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495327590] [2024-11-08 18:47:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495327590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:47:11,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:47:11,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:47:11,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343592674] [2024-11-08 18:47:11,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:47:11,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:47:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:47:11,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:47:11,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:47:11,768 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-08 18:47:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:11,985 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2024-11-08 18:47:11,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:47:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 92 [2024-11-08 18:47:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:11,994 INFO L225 Difference]: With dead ends: 217 [2024-11-08 18:47:11,994 INFO L226 Difference]: Without dead ends: 155 [2024-11-08 18:47:11,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:47:11,996 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 125 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:11,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 313 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:47:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-08 18:47:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2024-11-08 18:47:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 98 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 18:47:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2024-11-08 18:47:12,047 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 92 [2024-11-08 18:47:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:12,047 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2024-11-08 18:47:12,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-08 18:47:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2024-11-08 18:47:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 18:47:12,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:12,049 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] [2024-11-08 18:47:12,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:47:12,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:12,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash 285760680, now seen corresponding path program 1 times [2024-11-08 18:47:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:47:12,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207897781] [2024-11-08 18:47:12,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:12,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:47:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:47:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:47:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:47:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:47:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:47:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:47:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:47:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:47:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:47:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:47:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:47:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:47:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:47:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:12,417 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-08 18:47:12,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:47:12,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207897781] [2024-11-08 18:47:12,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207897781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:47:12,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:47:12,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:47:12,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508422365] [2024-11-08 18:47:12,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:47:12,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:47:12,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:47:12,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:47:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:47:12,428 INFO L87 Difference]: Start difference. First operand 127 states and 195 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-08 18:47:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:12,719 INFO L93 Difference]: Finished difference Result 406 states and 619 transitions. [2024-11-08 18:47:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:47:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 93 [2024-11-08 18:47:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:12,722 INFO L225 Difference]: With dead ends: 406 [2024-11-08 18:47:12,723 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 18:47:12,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:47:12,728 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 159 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:12,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 246 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:47:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 18:47:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 129. [2024-11-08 18:47:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 18:47:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2024-11-08 18:47:12,777 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 93 [2024-11-08 18:47:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:12,780 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2024-11-08 18:47:12,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-08 18:47:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2024-11-08 18:47:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 18:47:12,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:12,783 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] [2024-11-08 18:47:12,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:47:12,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:12,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1273246228, now seen corresponding path program 1 times [2024-11-08 18:47:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:47:12,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078851731] [2024-11-08 18:47:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:47:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:47:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:47:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:47:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:47:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:47:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:47:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:47:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:47:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:47:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:47:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:47:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:47:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:47:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:17,883 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-08 18:47:17,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:47:17,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078851731] [2024-11-08 18:47:17,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078851731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:47:17,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:47:17,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:47:17,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757133451] [2024-11-08 18:47:17,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:47:17,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:47:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:47:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:47:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:47:17,890 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-08 18:47:21,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:21,541 INFO L93 Difference]: Finished difference Result 384 states and 568 transitions. [2024-11-08 18:47:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:47:21,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 94 [2024-11-08 18:47:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:21,546 INFO L225 Difference]: With dead ends: 384 [2024-11-08 18:47:21,547 INFO L226 Difference]: Without dead ends: 258 [2024-11-08 18:47:21,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:47:21,549 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 253 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:21,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 358 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 18:47:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-08 18:47:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 165. [2024-11-08 18:47:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 130 states have internal predecessors, (182), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 18:47:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2024-11-08 18:47:21,649 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 94 [2024-11-08 18:47:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:21,651 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2024-11-08 18:47:21,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-08 18:47:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2024-11-08 18:47:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 18:47:21,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:21,660 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] [2024-11-08 18:47:21,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:47:21,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:21,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1015080790, now seen corresponding path program 1 times [2024-11-08 18:47:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:47:21,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213779651] [2024-11-08 18:47:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:47:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:47:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:47:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:47:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:47:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:47:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:47:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:47:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:47:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:47:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:47:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:47:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:47:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:47:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:47:22,251 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-08 18:47:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:47:22,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213779651] [2024-11-08 18:47:22,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213779651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:47:22,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:47:22,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:47:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091404414] [2024-11-08 18:47:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:47:22,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:47:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:47:22,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:47:22,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:47:22,255 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-08 18:47:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:47:22,566 INFO L93 Difference]: Finished difference Result 402 states and 593 transitions. [2024-11-08 18:47:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:47:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 94 [2024-11-08 18:47:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:47:22,572 INFO L225 Difference]: With dead ends: 402 [2024-11-08 18:47:22,573 INFO L226 Difference]: Without dead ends: 248 [2024-11-08 18:47:22,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:47:22,579 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:47:22,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 220 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:47:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-08 18:47:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 198. [2024-11-08 18:47:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 153 states have (on average 1.3986928104575163) internal successors, (214), 153 states have internal predecessors, (214), 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-08 18:47:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2024-11-08 18:47:22,643 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 94 [2024-11-08 18:47:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:47:22,644 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2024-11-08 18:47:22,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-08 18:47:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2024-11-08 18:47:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 18:47:22,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:47:22,649 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] [2024-11-08 18:47:22,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:47:22,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:47:22,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:47:22,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1437864838, now seen corresponding path program 1 times [2024-11-08 18:47:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:47:22,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640707695] [2024-11-08 18:47:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:47:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:47:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:48:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:48:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:48:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:48:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:48:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:48:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:48:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:48:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:48:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:48:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:48:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:48:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:48:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:20,775 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-08 18:48:20,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:48:20,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640707695] [2024-11-08 18:48:20,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640707695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:48:20,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:48:20,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:48:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693664433] [2024-11-08 18:48:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:48:20,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:48:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:48:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:48:20,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:48:20,782 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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-08 18:48:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:48:22,163 INFO L93 Difference]: Finished difference Result 334 states and 479 transitions. [2024-11-08 18:48:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:48:22,164 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 97 [2024-11-08 18:48:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:48:22,166 INFO L225 Difference]: With dead ends: 334 [2024-11-08 18:48:22,166 INFO L226 Difference]: Without dead ends: 332 [2024-11-08 18:48:22,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-11-08 18:48:22,168 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 286 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:48:22,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 709 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:48:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-08 18:48:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 219. [2024-11-08 18:48:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.4080459770114941) internal successors, (245), 174 states have internal predecessors, (245), 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-08 18:48:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2024-11-08 18:48:22,201 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 97 [2024-11-08 18:48:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:48:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2024-11-08 18:48:22,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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-08 18:48:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2024-11-08 18:48:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 18:48:22,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:48:22,204 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] [2024-11-08 18:48:22,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:48:22,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:48:22,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:48:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash 862957752, now seen corresponding path program 1 times [2024-11-08 18:48:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:48:22,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511935889] [2024-11-08 18:48:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:48:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:48:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:49:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:49:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:49:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:49:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:49:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:49:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:49:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:49:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:49:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:49:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:49:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:49:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:49:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:14,145 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-08 18:49:14,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:49:14,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511935889] [2024-11-08 18:49:14,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511935889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:49:14,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:49:14,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:49:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486267884] [2024-11-08 18:49:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:49:14,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:49:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:49:14,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:49:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:49:14,150 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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-08 18:49:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:49:16,408 INFO L93 Difference]: Finished difference Result 355 states and 510 transitions. [2024-11-08 18:49:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:49:16,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 97 [2024-11-08 18:49:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:49:16,411 INFO L225 Difference]: With dead ends: 355 [2024-11-08 18:49:16,411 INFO L226 Difference]: Without dead ends: 353 [2024-11-08 18:49:16,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-08 18:49:16,415 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 319 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:49:16,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 601 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:49:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-08 18:49:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 239. [2024-11-08 18:49:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 194 states have (on average 1.407216494845361) internal successors, (273), 194 states have internal predecessors, (273), 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-08 18:49:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 351 transitions. [2024-11-08 18:49:16,456 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 351 transitions. Word has length 97 [2024-11-08 18:49:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:49:16,457 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 351 transitions. [2024-11-08 18:49:16,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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-08 18:49:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 351 transitions. [2024-11-08 18:49:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 18:49:16,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:49:16,461 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] [2024-11-08 18:49:16,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:49:16,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:49:16,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:49:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1168158716, now seen corresponding path program 1 times [2024-11-08 18:49:16,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:49:16,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302914178] [2024-11-08 18:49:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:49:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:49:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:49:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:49:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:49:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:49:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:49:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:49:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:49:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:49:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:49:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:49:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:49:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:49:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:49:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:49:16,803 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-08 18:49:16,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:49:16,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302914178] [2024-11-08 18:49:16,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302914178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:49:16,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:49:16,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:49:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230744791] [2024-11-08 18:49:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:49:16,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:49:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:49:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:49:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:49:16,806 INFO L87 Difference]: Start difference. First operand 239 states and 351 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-08 18:49:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:49:17,009 INFO L93 Difference]: Finished difference Result 451 states and 661 transitions. [2024-11-08 18:49:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:49:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 97 [2024-11-08 18:49:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:49:17,013 INFO L225 Difference]: With dead ends: 451 [2024-11-08 18:49:17,013 INFO L226 Difference]: Without dead ends: 290 [2024-11-08 18:49:17,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:49:17,015 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 153 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:49:17,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 341 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:49:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-08 18:49:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 240. [2024-11-08 18:49:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.405128205128205) internal successors, (274), 195 states have internal predecessors, (274), 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-08 18:49:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 352 transitions. [2024-11-08 18:49:17,049 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 352 transitions. Word has length 97 [2024-11-08 18:49:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:49:17,050 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 352 transitions. [2024-11-08 18:49:17,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-08 18:49:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 352 transitions. [2024-11-08 18:49:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 18:49:17,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:49:17,052 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] [2024-11-08 18:49:17,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:49:17,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:49:17,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:49:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash 650816425, now seen corresponding path program 1 times [2024-11-08 18:49:17,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:49:17,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557587930] [2024-11-08 18:49:17,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:49:17,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:49:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:50:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:50:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:50:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:50:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:50:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:50:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:50:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:50:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:50:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:50:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:50:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:50:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:50:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:50:11,539 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-08 18:50:11,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:50:11,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557587930] [2024-11-08 18:50:11,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557587930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:50:11,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:50:11,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:50:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727066631] [2024-11-08 18:50:11,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:50:11,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:50:11,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:50:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:50:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:50:11,542 INFO L87 Difference]: Start difference. First operand 240 states and 352 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-08 18:50:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:50:14,030 INFO L93 Difference]: Finished difference Result 376 states and 534 transitions. [2024-11-08 18:50:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 18:50:14,031 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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 98 [2024-11-08 18:50:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:50:14,033 INFO L225 Difference]: With dead ends: 376 [2024-11-08 18:50:14,033 INFO L226 Difference]: Without dead ends: 374 [2024-11-08 18:50:14,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 18:50:14,035 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 358 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:50:14,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 861 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 18:50:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-08 18:50:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 241. [2024-11-08 18:50:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.403061224489796) internal successors, (275), 196 states have internal predecessors, (275), 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-08 18:50:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 353 transitions. [2024-11-08 18:50:14,064 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 353 transitions. Word has length 98 [2024-11-08 18:50:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:50:14,065 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 353 transitions. [2024-11-08 18:50:14,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-08 18:50:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 353 transitions. [2024-11-08 18:50:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 18:50:14,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:50:14,067 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] [2024-11-08 18:50:14,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:50:14,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:50:14,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:50:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1038127317, now seen corresponding path program 1 times [2024-11-08 18:50:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:50:14,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629232660] [2024-11-08 18:50:14,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:50:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:50:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:06,472 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-08 18:51:06,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:06,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629232660] [2024-11-08 18:51:06,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629232660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:06,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:06,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:51:06,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880651944] [2024-11-08 18:51:06,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:06,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:51:06,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:06,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:51:06,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:51:06,475 INFO L87 Difference]: Start difference. First operand 241 states and 353 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-08 18:51:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:09,389 INFO L93 Difference]: Finished difference Result 410 states and 580 transitions. [2024-11-08 18:51:09,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 18:51:09,390 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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 98 [2024-11-08 18:51:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:09,393 INFO L225 Difference]: With dead ends: 410 [2024-11-08 18:51:09,393 INFO L226 Difference]: Without dead ends: 408 [2024-11-08 18:51:09,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=336, Invalid=996, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 18:51:09,395 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 260 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:09,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 891 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 18:51:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-08 18:51:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 242. [2024-11-08 18:51:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 197 states have (on average 1.401015228426396) internal successors, (276), 197 states have internal predecessors, (276), 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-08 18:51:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2024-11-08 18:51:09,426 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 98 [2024-11-08 18:51:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:09,426 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2024-11-08 18:51:09,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-08 18:51:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2024-11-08 18:51:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:51:09,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:09,428 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] [2024-11-08 18:51:09,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:51:09,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:09,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1855560338, now seen corresponding path program 1 times [2024-11-08 18:51:09,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:09,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162169513] [2024-11-08 18:51:09,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:09,988 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-08 18:51:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162169513] [2024-11-08 18:51:09,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162169513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:09,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:09,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:51:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779379125] [2024-11-08 18:51:09,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:09,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:51:09,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:09,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:51:09,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:51:09,992 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-08 18:51:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:10,618 INFO L93 Difference]: Finished difference Result 591 states and 856 transitions. [2024-11-08 18:51:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:51:10,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 99 [2024-11-08 18:51:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:10,621 INFO L225 Difference]: With dead ends: 591 [2024-11-08 18:51:10,621 INFO L226 Difference]: Without dead ends: 383 [2024-11-08 18:51:10,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:51:10,623 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 155 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:10,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 313 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:51:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-08 18:51:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 331. [2024-11-08 18:51:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 286 states have (on average 1.4090909090909092) internal successors, (403), 286 states have internal predecessors, (403), 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-08 18:51:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 481 transitions. [2024-11-08 18:51:10,661 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 481 transitions. Word has length 99 [2024-11-08 18:51:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:10,662 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 481 transitions. [2024-11-08 18:51:10,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-08 18:51:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 481 transitions. [2024-11-08 18:51:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:51:10,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:10,664 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] [2024-11-08 18:51:10,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:51:10,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:10,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash -321168656, now seen corresponding path program 1 times [2024-11-08 18:51:10,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:10,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694036220] [2024-11-08 18:51:10,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:10,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:11,237 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-08 18:51:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694036220] [2024-11-08 18:51:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694036220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:51:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578285695] [2024-11-08 18:51:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:11,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:51:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:51:11,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:51:11,240 INFO L87 Difference]: Start difference. First operand 331 states and 481 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-08 18:51:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:11,932 INFO L93 Difference]: Finished difference Result 585 states and 843 transitions. [2024-11-08 18:51:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:51:11,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 99 [2024-11-08 18:51:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:11,935 INFO L225 Difference]: With dead ends: 585 [2024-11-08 18:51:11,935 INFO L226 Difference]: Without dead ends: 358 [2024-11-08 18:51:11,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:51:11,937 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:11,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 376 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:51:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-08 18:51:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 330. [2024-11-08 18:51:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 285 states have (on average 1.407017543859649) internal successors, (401), 285 states have internal predecessors, (401), 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-08 18:51:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 479 transitions. [2024-11-08 18:51:11,976 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 479 transitions. Word has length 99 [2024-11-08 18:51:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:11,977 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 479 transitions. [2024-11-08 18:51:11,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-08 18:51:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 479 transitions. [2024-11-08 18:51:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 18:51:11,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:11,979 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] [2024-11-08 18:51:11,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:51:11,979 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:11,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1362533756, now seen corresponding path program 1 times [2024-11-08 18:51:11,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:11,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352969834] [2024-11-08 18:51:11,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,094 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-08 18:51:12,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:12,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352969834] [2024-11-08 18:51:12,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352969834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:12,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:12,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:51:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735160416] [2024-11-08 18:51:12,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:12,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:51:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:51:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:51:12,096 INFO L87 Difference]: Start difference. First operand 330 states and 479 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-08 18:51:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:12,231 INFO L93 Difference]: Finished difference Result 611 states and 888 transitions. [2024-11-08 18:51:12,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:51:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 100 [2024-11-08 18:51:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:12,234 INFO L225 Difference]: With dead ends: 611 [2024-11-08 18:51:12,234 INFO L226 Difference]: Without dead ends: 385 [2024-11-08 18:51:12,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:51:12,237 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:12,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 168 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:51:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-08 18:51:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 339. [2024-11-08 18:51:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 294 states have (on average 1.4183673469387754) internal successors, (417), 294 states have internal predecessors, (417), 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-08 18:51:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 495 transitions. [2024-11-08 18:51:12,273 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 495 transitions. Word has length 100 [2024-11-08 18:51:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:12,273 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 495 transitions. [2024-11-08 18:51:12,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-08 18:51:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 495 transitions. [2024-11-08 18:51:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 18:51:12,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:12,275 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] [2024-11-08 18:51:12,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:51:12,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:12,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1502230811, now seen corresponding path program 1 times [2024-11-08 18:51:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:12,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554017051] [2024-11-08 18:51:12,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:12,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:12,633 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-08 18:51:12,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554017051] [2024-11-08 18:51:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554017051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:12,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:12,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:51:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795919074] [2024-11-08 18:51:12,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:12,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:51:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:51:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:51:12,635 INFO L87 Difference]: Start difference. First operand 339 states and 495 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-08 18:51:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:13,153 INFO L93 Difference]: Finished difference Result 676 states and 980 transitions. [2024-11-08 18:51:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:51:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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 102 [2024-11-08 18:51:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:13,156 INFO L225 Difference]: With dead ends: 676 [2024-11-08 18:51:13,157 INFO L226 Difference]: Without dead ends: 458 [2024-11-08 18:51:13,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:51:13,158 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 125 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:13,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 430 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:51:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-08 18:51:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2024-11-08 18:51:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 327 states have (on average 1.4220183486238531) internal successors, (465), 327 states have internal predecessors, (465), 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-08 18:51:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 543 transitions. [2024-11-08 18:51:13,196 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 543 transitions. Word has length 102 [2024-11-08 18:51:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:13,197 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 543 transitions. [2024-11-08 18:51:13,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-08 18:51:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 543 transitions. [2024-11-08 18:51:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 18:51:13,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:13,199 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] [2024-11-08 18:51:13,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:51:13,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:13,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1213270115, now seen corresponding path program 1 times [2024-11-08 18:51:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:13,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294570500] [2024-11-08 18:51:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:13,604 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-08 18:51:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294570500] [2024-11-08 18:51:13,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294570500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:13,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:13,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:51:13,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937055453] [2024-11-08 18:51:13,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:13,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:51:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:13,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:51:13,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:51:13,609 INFO L87 Difference]: Start difference. First operand 372 states and 543 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-08 18:51:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:14,180 INFO L93 Difference]: Finished difference Result 757 states and 1095 transitions. [2024-11-08 18:51:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:51:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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 102 [2024-11-08 18:51:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:14,183 INFO L225 Difference]: With dead ends: 757 [2024-11-08 18:51:14,184 INFO L226 Difference]: Without dead ends: 531 [2024-11-08 18:51:14,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:51:14,185 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 128 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:14,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 445 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:51:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-08 18:51:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 441. [2024-11-08 18:51:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.4242424242424243) internal successors, (564), 396 states have internal predecessors, (564), 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-08 18:51:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 642 transitions. [2024-11-08 18:51:14,219 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 642 transitions. Word has length 102 [2024-11-08 18:51:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 642 transitions. [2024-11-08 18:51:14,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-08 18:51:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 642 transitions. [2024-11-08 18:51:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 18:51:14,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:14,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] [2024-11-08 18:51:14,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:51:14,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:14,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1865938894, now seen corresponding path program 1 times [2024-11-08 18:51:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492899738] [2024-11-08 18:51:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,307 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-08 18:51:14,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:14,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492899738] [2024-11-08 18:51:14,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492899738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:14,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:14,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:51:14,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867812634] [2024-11-08 18:51:14,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:14,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:51:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:14,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:51:14,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:51:14,310 INFO L87 Difference]: Start difference. First operand 441 states and 642 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-08 18:51:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:14,426 INFO L93 Difference]: Finished difference Result 895 states and 1301 transitions. [2024-11-08 18:51:14,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:51:14,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 103 [2024-11-08 18:51:14,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:14,429 INFO L225 Difference]: With dead ends: 895 [2024-11-08 18:51:14,430 INFO L226 Difference]: Without dead ends: 580 [2024-11-08 18:51:14,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:51:14,431 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 30 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:14,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 190 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:51:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-11-08 18:51:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 521. [2024-11-08 18:51:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 476 states have (on average 1.4012605042016806) internal successors, (667), 476 states have internal predecessors, (667), 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-08 18:51:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 745 transitions. [2024-11-08 18:51:14,469 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 745 transitions. Word has length 103 [2024-11-08 18:51:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:14,470 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 745 transitions. [2024-11-08 18:51:14,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-08 18:51:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 745 transitions. [2024-11-08 18:51:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 18:51:14,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:14,472 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] [2024-11-08 18:51:14,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:51:14,472 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:14,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:14,473 INFO L85 PathProgramCache]: Analyzing trace with hash -888418340, now seen corresponding path program 1 times [2024-11-08 18:51:14,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:14,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10182771] [2024-11-08 18:51:14,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:14,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,564 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-08 18:51:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:14,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10182771] [2024-11-08 18:51:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10182771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:14,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:51:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069518136] [2024-11-08 18:51:14,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:14,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:51:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:14,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:51:14,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:51:14,567 INFO L87 Difference]: Start difference. First operand 521 states and 745 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-08 18:51:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:14,671 INFO L93 Difference]: Finished difference Result 871 states and 1250 transitions. [2024-11-08 18:51:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:51:14,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 103 [2024-11-08 18:51:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:14,675 INFO L225 Difference]: With dead ends: 871 [2024-11-08 18:51:14,675 INFO L226 Difference]: Without dead ends: 533 [2024-11-08 18:51:14,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:51:14,676 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:14,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 190 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:51:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-08 18:51:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 499. [2024-11-08 18:51:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 454 states have (on average 1.3986784140969164) internal successors, (635), 454 states have internal predecessors, (635), 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-08 18:51:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 713 transitions. [2024-11-08 18:51:14,712 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 713 transitions. Word has length 103 [2024-11-08 18:51:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:14,712 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 713 transitions. [2024-11-08 18:51:14,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-08 18:51:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 713 transitions. [2024-11-08 18:51:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 18:51:14,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:14,714 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] [2024-11-08 18:51:14,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:51:14,714 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:14,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1552924040, now seen corresponding path program 1 times [2024-11-08 18:51:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719337330] [2024-11-08 18:51:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:15,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:15,013 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-08 18:51:15,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719337330] [2024-11-08 18:51:15,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719337330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:15,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:15,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:51:15,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860577455] [2024-11-08 18:51:15,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:15,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:51:15,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:51:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:51:15,016 INFO L87 Difference]: Start difference. First operand 499 states and 713 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-08 18:51:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:15,332 INFO L93 Difference]: Finished difference Result 857 states and 1232 transitions. [2024-11-08 18:51:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:51:15,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 105 [2024-11-08 18:51:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:15,335 INFO L225 Difference]: With dead ends: 857 [2024-11-08 18:51:15,336 INFO L226 Difference]: Without dead ends: 512 [2024-11-08 18:51:15,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-08 18:51:15,337 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 81 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:15,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 266 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:51:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-08 18:51:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 462. [2024-11-08 18:51:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 417 states have (on average 1.4052757793764987) internal successors, (586), 417 states have internal predecessors, (586), 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-08 18:51:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 664 transitions. [2024-11-08 18:51:15,374 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 664 transitions. Word has length 105 [2024-11-08 18:51:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:15,374 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 664 transitions. [2024-11-08 18:51:15,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-08 18:51:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 664 transitions. [2024-11-08 18:51:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 18:51:15,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:15,376 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] [2024-11-08 18:51:15,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:51:15,377 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:15,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 827427223, now seen corresponding path program 1 times [2024-11-08 18:51:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212493731] [2024-11-08 18:51:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:51:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:51:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:51:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:51:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:51:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:51:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:51:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:51:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:51:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:51:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:51:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:51:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:51:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:51:17,981 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-08 18:51:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:51:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212493731] [2024-11-08 18:51:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212493731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:51:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:51:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 18:51:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905330645] [2024-11-08 18:51:17,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:51:17,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:51:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:51:17,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:51:17,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:51:17,984 INFO L87 Difference]: Start difference. First operand 462 states and 664 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-08 18:51:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:51:19,438 INFO L93 Difference]: Finished difference Result 917 states and 1297 transitions. [2024-11-08 18:51:19,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:51:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 105 [2024-11-08 18:51:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:51:19,442 INFO L225 Difference]: With dead ends: 917 [2024-11-08 18:51:19,442 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:51:19,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:51:19,443 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 324 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:51:19,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 353 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:51:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:51:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 495. [2024-11-08 18:51:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 450 states have (on average 1.4022222222222223) internal successors, (631), 450 states have internal predecessors, (631), 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-08 18:51:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 709 transitions. [2024-11-08 18:51:19,489 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 709 transitions. Word has length 105 [2024-11-08 18:51:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:51:19,489 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 709 transitions. [2024-11-08 18:51:19,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-08 18:51:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 709 transitions. [2024-11-08 18:51:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 18:51:19,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:51:19,491 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] [2024-11-08 18:51:19,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:51:19,492 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:51:19,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:51:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -193641131, now seen corresponding path program 1 times [2024-11-08 18:51:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:51:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475457661] [2024-11-08 18:51:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:51:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:51:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:52:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:52:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:52:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:52:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:52:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:52:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:52:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:52:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:52:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:52:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:52:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:52:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:52:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:52:13,959 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-08 18:52:13,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:52:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475457661] [2024-11-08 18:52:13,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475457661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:52:13,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:52:13,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 18:52:13,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136604071] [2024-11-08 18:52:13,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:52:13,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:52:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:52:13,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:52:13,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:52:13,962 INFO L87 Difference]: Start difference. First operand 495 states and 709 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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-08 18:52:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:52:20,697 INFO L93 Difference]: Finished difference Result 835 states and 1155 transitions. [2024-11-08 18:52:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 18:52:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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 105 [2024-11-08 18:52:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:52:20,701 INFO L225 Difference]: With dead ends: 835 [2024-11-08 18:52:20,701 INFO L226 Difference]: Without dead ends: 651 [2024-11-08 18:52:20,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=459, Invalid=1797, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 18:52:20,704 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 428 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:52:20,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 586 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:52:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-08 18:52:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 507. [2024-11-08 18:52:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 462 states have (on average 1.3917748917748918) internal successors, (643), 462 states have internal predecessors, (643), 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-08 18:52:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 721 transitions. [2024-11-08 18:52:20,759 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 721 transitions. Word has length 105 [2024-11-08 18:52:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:52:20,760 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 721 transitions. [2024-11-08 18:52:20,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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-08 18:52:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 721 transitions. [2024-11-08 18:52:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 18:52:20,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:52:20,762 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] [2024-11-08 18:52:20,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:52:20,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:52:20,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:52:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash -327654637, now seen corresponding path program 1 times [2024-11-08 18:52:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:52:20,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899716387] [2024-11-08 18:52:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:52:20,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:52:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:53:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:53:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:53:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:53:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:53:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:53:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:53:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:53:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:53:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:53:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:53:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:53:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:53:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:12,049 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-08 18:53:12,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:12,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899716387] [2024-11-08 18:53:12,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899716387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:12,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:12,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 18:53:12,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152202510] [2024-11-08 18:53:12,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:12,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:53:12,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:12,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:53:12,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:53:12,052 INFO L87 Difference]: Start difference. First operand 507 states and 721 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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-08 18:53:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:19,442 INFO L93 Difference]: Finished difference Result 1037 states and 1434 transitions. [2024-11-08 18:53:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 18:53:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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 105 [2024-11-08 18:53:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:19,445 INFO L225 Difference]: With dead ends: 1037 [2024-11-08 18:53:19,445 INFO L226 Difference]: Without dead ends: 697 [2024-11-08 18:53:19,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=416, Invalid=1654, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 18:53:19,447 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 400 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:19,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 563 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 18:53:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-08 18:53:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 519. [2024-11-08 18:53:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 474 states have (on average 1.3818565400843883) internal successors, (655), 474 states have internal predecessors, (655), 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-08 18:53:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 733 transitions. [2024-11-08 18:53:19,502 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 733 transitions. Word has length 105 [2024-11-08 18:53:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:19,502 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 733 transitions. [2024-11-08 18:53:19,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 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-08 18:53:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 733 transitions. [2024-11-08 18:53:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 18:53:19,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:19,504 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] [2024-11-08 18:53:19,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 18:53:19,505 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:53:19,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash -628860391, now seen corresponding path program 1 times [2024-11-08 18:53:19,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927785061] [2024-11-08 18:53:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:53:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:53:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:53:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:53:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:53:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:53:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:53:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:53:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:53:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:53:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:53:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:53:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:53:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:20,174 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-08 18:53:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:20,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927785061] [2024-11-08 18:53:20,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927785061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:20,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:20,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 18:53:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781332359] [2024-11-08 18:53:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:20,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:53:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:53:20,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:53:20,177 INFO L87 Difference]: Start difference. First operand 519 states and 733 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-08 18:53:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:21,320 INFO L93 Difference]: Finished difference Result 941 states and 1320 transitions. [2024-11-08 18:53:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:53:21,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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 105 [2024-11-08 18:53:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:21,324 INFO L225 Difference]: With dead ends: 941 [2024-11-08 18:53:21,324 INFO L226 Difference]: Without dead ends: 633 [2024-11-08 18:53:21,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:53:21,326 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 198 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:21,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 600 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:53:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-08 18:53:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 547. [2024-11-08 18:53:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 502 states have (on average 1.3804780876494025) internal successors, (693), 502 states have internal predecessors, (693), 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-08 18:53:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 771 transitions. [2024-11-08 18:53:21,383 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 771 transitions. Word has length 105 [2024-11-08 18:53:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:21,384 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 771 transitions. [2024-11-08 18:53:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-08 18:53:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 771 transitions. [2024-11-08 18:53:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 18:53:21,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:21,386 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] [2024-11-08 18:53:21,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 18:53:21,386 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:53:21,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1843882466, now seen corresponding path program 1 times [2024-11-08 18:53:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:21,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390550212] [2024-11-08 18:53:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:54:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:54:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:54:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:54:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:54:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:54:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:54:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:54:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:54:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:54:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:54:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:54:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:54:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:13,567 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-08 18:54:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:54:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390550212] [2024-11-08 18:54:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390550212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:54:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:54:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-08 18:54:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959200380] [2024-11-08 18:54:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:54:13,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:54:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:54:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:54:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:54:13,570 INFO L87 Difference]: Start difference. First operand 547 states and 771 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 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-08 18:54:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:54:26,102 INFO L93 Difference]: Finished difference Result 665 states and 895 transitions. [2024-11-08 18:54:26,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-08 18:54:26,103 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 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 106 [2024-11-08 18:54:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:54:26,105 INFO L225 Difference]: With dead ends: 665 [2024-11-08 18:54:26,106 INFO L226 Difference]: Without dead ends: 663 [2024-11-08 18:54:26,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=928, Invalid=3764, Unknown=0, NotChecked=0, Total=4692 [2024-11-08 18:54:26,109 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 484 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:54:26,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 602 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 18:54:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-08 18:54:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 545. [2024-11-08 18:54:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 500 states have (on average 1.378) internal successors, (689), 500 states have internal predecessors, (689), 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-08 18:54:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 767 transitions. [2024-11-08 18:54:26,163 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 767 transitions. Word has length 106 [2024-11-08 18:54:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:54:26,163 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 767 transitions. [2024-11-08 18:54:26,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 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-08 18:54:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 767 transitions. [2024-11-08 18:54:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 18:54:26,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:54:26,166 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] [2024-11-08 18:54:26,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 18:54:26,166 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:54:26,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:54:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1703333856, now seen corresponding path program 1 times [2024-11-08 18:54:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:54:26,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054033654] [2024-11-08 18:54:26,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:54:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:55:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:55:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:55:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:55:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:55:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:55:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:09,139 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-08 18:55:09,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:09,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054033654] [2024-11-08 18:55:09,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054033654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:09,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:09,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 18:55:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745006657] [2024-11-08 18:55:09,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:09,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 18:55:09,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:09,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 18:55:09,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:55:09,142 INFO L87 Difference]: Start difference. First operand 545 states and 767 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 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-08 18:55:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:19,302 INFO L93 Difference]: Finished difference Result 701 states and 934 transitions. [2024-11-08 18:55:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 18:55:19,303 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 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 106 [2024-11-08 18:55:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:19,306 INFO L225 Difference]: With dead ends: 701 [2024-11-08 18:55:19,306 INFO L226 Difference]: Without dead ends: 699 [2024-11-08 18:55:19,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=785, Invalid=3375, Unknown=0, NotChecked=0, Total=4160 [2024-11-08 18:55:19,309 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 309 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:19,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 531 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 18:55:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-08 18:55:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 543. [2024-11-08 18:55:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 498 states have (on average 1.3755020080321285) internal successors, (685), 498 states have internal predecessors, (685), 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-08 18:55:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 763 transitions. [2024-11-08 18:55:19,362 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 763 transitions. Word has length 106 [2024-11-08 18:55:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:19,363 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 763 transitions. [2024-11-08 18:55:19,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 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-08 18:55:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 763 transitions. [2024-11-08 18:55:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:55:19,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:19,365 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-08 18:55:19,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 18:55:19,365 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:19,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash 951399726, now seen corresponding path program 1 times [2024-11-08 18:55:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:19,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732843209] [2024-11-08 18:55:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:55:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:55:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:55:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:55:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:55:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:55:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:22,133 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-08 18:55:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:22,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732843209] [2024-11-08 18:55:22,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732843209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:22,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:22,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:55:22,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675531400] [2024-11-08 18:55:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:22,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:55:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:22,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:55:22,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:55:22,136 INFO L87 Difference]: Start difference. First operand 543 states and 763 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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-08 18:55:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:23,483 INFO L93 Difference]: Finished difference Result 917 states and 1288 transitions. [2024-11-08 18:55:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:55:23,484 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), 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-08 18:55:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:23,486 INFO L225 Difference]: With dead ends: 917 [2024-11-08 18:55:23,487 INFO L226 Difference]: Without dead ends: 577 [2024-11-08 18:55:23,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:55:23,488 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 192 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:23,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 361 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:55:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-08 18:55:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 543. [2024-11-08 18:55:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 498 states have (on average 1.3674698795180722) internal successors, (681), 498 states have internal predecessors, (681), 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-08 18:55:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 759 transitions. [2024-11-08 18:55:23,533 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 759 transitions. Word has length 109 [2024-11-08 18:55:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:23,533 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 759 transitions. [2024-11-08 18:55:23,534 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), 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-08 18:55:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 759 transitions. [2024-11-08 18:55:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:55:23,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:23,535 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-08 18:55:23,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 18:55:23,536 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:23,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash -69668628, now seen corresponding path program 1 times [2024-11-08 18:55:23,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:23,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371996385] [2024-11-08 18:55:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:56:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:56:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:56:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:56:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:56:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:56:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:56:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:56:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:56:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:56:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:56:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:56:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:56:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:15,488 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-08 18:56:15,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:56:15,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371996385] [2024-11-08 18:56:15,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371996385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:56:15,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:56:15,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 18:56:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716995939] [2024-11-08 18:56:15,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:56:15,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:56:15,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:56:15,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:56:15,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:56:15,491 INFO L87 Difference]: Start difference. First operand 543 states and 759 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 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-08 18:56:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:56:19,401 INFO L93 Difference]: Finished difference Result 625 states and 844 transitions. [2024-11-08 18:56:19,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 18:56:19,402 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 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-08 18:56:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:56:19,404 INFO L225 Difference]: With dead ends: 625 [2024-11-08 18:56:19,404 INFO L226 Difference]: Without dead ends: 623 [2024-11-08 18:56:19,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 18:56:19,405 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 396 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:56:19,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 627 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 18:56:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-08 18:56:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 545. [2024-11-08 18:56:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 500 states have (on average 1.368) internal successors, (684), 500 states have internal predecessors, (684), 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-08 18:56:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 762 transitions. [2024-11-08 18:56:19,473 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 762 transitions. Word has length 109 [2024-11-08 18:56:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:56:19,474 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 762 transitions. [2024-11-08 18:56:19,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 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-08 18:56:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 762 transitions. [2024-11-08 18:56:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:56:19,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:56:19,476 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-08 18:56:19,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 18:56:19,477 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:56:19,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:56:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash -270811254, now seen corresponding path program 1 times [2024-11-08 18:56:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:56:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199987452] [2024-11-08 18:56:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:56:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:56:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:56:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:56:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:56:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:56:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:56:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:56:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:56:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:56:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:56:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:56:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:56:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:56:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:56:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:21,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-08 18:56:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:56:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199987452] [2024-11-08 18:56:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199987452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:56:21,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:56:21,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:56:21,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531841071] [2024-11-08 18:56:21,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:56:21,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:56:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:56:21,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:56:21,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:56:21,008 INFO L87 Difference]: Start difference. First operand 545 states and 762 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-08 18:56:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:56:21,514 INFO L93 Difference]: Finished difference Result 919 states and 1295 transitions. [2024-11-08 18:56:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:56:21,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-08 18:56:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:56:21,517 INFO L225 Difference]: With dead ends: 919 [2024-11-08 18:56:21,517 INFO L226 Difference]: Without dead ends: 567 [2024-11-08 18:56:21,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:56:21,519 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 102 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:56:21,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 261 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:56:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-08 18:56:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 545. [2024-11-08 18:56:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 500 states have (on average 1.36) internal successors, (680), 500 states have internal predecessors, (680), 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-08 18:56:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 758 transitions. [2024-11-08 18:56:21,593 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 758 transitions. Word has length 109 [2024-11-08 18:56:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:56:21,593 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 758 transitions. [2024-11-08 18:56:21,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-08 18:56:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 758 transitions. [2024-11-08 18:56:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:56:21,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:56:21,595 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-08 18:56:21,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 18:56:21,595 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:56:21,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:56:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash -203682134, now seen corresponding path program 1 times [2024-11-08 18:56:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:56:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430111508] [2024-11-08 18:56:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:56:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:56:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:57:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:57:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:57:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:57:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:57:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:57:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:04,327 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-08 18:57:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430111508] [2024-11-08 18:57:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430111508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:57:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713911909] [2024-11-08 18:57:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:04,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:57:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:57:04,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:57:04,330 INFO L87 Difference]: Start difference. First operand 545 states and 758 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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-08 18:57:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:06,874 INFO L93 Difference]: Finished difference Result 641 states and 859 transitions. [2024-11-08 18:57:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:57:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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-08 18:57:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:06,877 INFO L225 Difference]: With dead ends: 641 [2024-11-08 18:57:06,877 INFO L226 Difference]: Without dead ends: 639 [2024-11-08 18:57:06,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2024-11-08 18:57:06,878 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 224 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:06,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 799 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 18:57:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-08 18:57:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 547. [2024-11-08 18:57:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 502 states have (on average 1.3605577689243027) internal successors, (683), 502 states have internal predecessors, (683), 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-08 18:57:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 761 transitions. [2024-11-08 18:57:06,922 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 761 transitions. Word has length 109 [2024-11-08 18:57:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:06,922 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 761 transitions. [2024-11-08 18:57:06,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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-08 18:57:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 761 transitions. [2024-11-08 18:57:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:57:06,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:06,924 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-08 18:57:06,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 18:57:06,925 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:06,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:06,925 INFO L85 PathProgramCache]: Analyzing trace with hash 70879982, now seen corresponding path program 1 times [2024-11-08 18:57:06,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:06,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021058601] [2024-11-08 18:57:06,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:06,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:57:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:57:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:57:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:57:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:57:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:57:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:07,435 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-08 18:57:07,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:07,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021058601] [2024-11-08 18:57:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021058601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:07,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:07,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:57:07,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005269068] [2024-11-08 18:57:07,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:07,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:57:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:57:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:57:07,437 INFO L87 Difference]: Start difference. First operand 547 states and 761 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-08 18:57:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:08,255 INFO L93 Difference]: Finished difference Result 909 states and 1274 transitions. [2024-11-08 18:57:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:57:08,255 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-08 18:57:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:08,258 INFO L225 Difference]: With dead ends: 909 [2024-11-08 18:57:08,258 INFO L226 Difference]: Without dead ends: 566 [2024-11-08 18:57:08,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:57:08,259 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 171 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:08,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 440 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:57:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-08 18:57:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 512. [2024-11-08 18:57:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 467 states have (on average 1.36830835117773) internal successors, (639), 467 states have internal predecessors, (639), 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-08 18:57:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 717 transitions. [2024-11-08 18:57:08,321 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 717 transitions. Word has length 109 [2024-11-08 18:57:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:08,321 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 717 transitions. [2024-11-08 18:57:08,322 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-08 18:57:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 717 transitions. [2024-11-08 18:57:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:57:08,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:08,323 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] [2024-11-08 18:57:08,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 18:57:08,323 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:08,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1999265127, now seen corresponding path program 1 times [2024-11-08 18:57:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699719070] [2024-11-08 18:57:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:57:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:57:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:57:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:57:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:57:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:57:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:57:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:57:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:57:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:57:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:57:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:57:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:57:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,392 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-08 18:57:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:58,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699719070] [2024-11-08 18:57:58,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699719070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:58,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:58,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 18:57:58,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122748471] [2024-11-08 18:57:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:58,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 18:57:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:58,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 18:57:58,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-08 18:57:58,395 INFO L87 Difference]: Start difference. First operand 512 states and 717 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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-08 18:58:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:03,436 INFO L93 Difference]: Finished difference Result 574 states and 781 transitions. [2024-11-08 18:58:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 18:58:03,436 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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 110 [2024-11-08 18:58:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:03,438 INFO L225 Difference]: With dead ends: 574 [2024-11-08 18:58:03,438 INFO L226 Difference]: Without dead ends: 572 [2024-11-08 18:58:03,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 18:58:03,440 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 328 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:03,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 679 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 18:58:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-08 18:58:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 504. [2024-11-08 18:58:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 459 states have (on average 1.3703703703703705) internal successors, (629), 459 states have internal predecessors, (629), 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-08 18:58:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 707 transitions. [2024-11-08 18:58:03,489 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 707 transitions. Word has length 110 [2024-11-08 18:58:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 707 transitions. [2024-11-08 18:58:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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-08 18:58:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 707 transitions. [2024-11-08 18:58:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:58:03,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:03,490 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] [2024-11-08 18:58:03,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 18:58:03,490 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:03,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2139813737, now seen corresponding path program 1 times [2024-11-08 18:58:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:03,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390657166] [2024-11-08 18:58:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:03,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:58:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:58:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:58:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:58:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:58:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:58:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:58:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:58:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:58:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:58:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:58:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:48,411 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-08 18:58:48,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:48,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390657166] [2024-11-08 18:58:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390657166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:58:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:58:48,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 18:58:48,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425130318] [2024-11-08 18:58:48,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:58:48,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:58:48,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:48,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:58:48,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:58:48,413 INFO L87 Difference]: Start difference. First operand 504 states and 707 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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-08 18:58:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:52,305 INFO L93 Difference]: Finished difference Result 574 states and 781 transitions. [2024-11-08 18:58:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 18:58:52,306 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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 110 [2024-11-08 18:58:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:52,309 INFO L225 Difference]: With dead ends: 574 [2024-11-08 18:58:52,309 INFO L226 Difference]: Without dead ends: 572 [2024-11-08 18:58:52,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=335, Invalid=1225, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 18:58:52,311 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 132 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:52,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 845 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 18:58:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-08 18:58:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 496. [2024-11-08 18:58:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 451 states have (on average 1.3725055432372506) internal successors, (619), 451 states have internal predecessors, (619), 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-08 18:58:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 697 transitions. [2024-11-08 18:58:52,396 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 697 transitions. Word has length 110 [2024-11-08 18:58:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:52,396 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 697 transitions. [2024-11-08 18:58:52,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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-08 18:58:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 697 transitions. [2024-11-08 18:58:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 18:58:52,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:52,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:58:52,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 18:58:52,399 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:52,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2119003545, now seen corresponding path program 1 times [2024-11-08 18:58:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:52,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356558584] [2024-11-08 18:58:52,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:52,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:58:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:58:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:58:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:58:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:58:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:58:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:58:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:58:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:58:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:58:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:58:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 18:58:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 18:58:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 18:58:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 18:58:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 18:58:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 18:58:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 18:58:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 18:58:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 18:58:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 18:58:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 18:58:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 18:58:52,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356558584] [2024-11-08 18:58:52,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356558584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:58:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053333469] [2024-11-08 18:58:52,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:52,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:58:52,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:58:52,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:58:52,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:58:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:53,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 18:58:53,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 89 proven. 705 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-11-08 18:58:53,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:58:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2024-11-08 18:58:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053333469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:58:54,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:58:54,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 7] total 19 [2024-11-08 18:58:54,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405919129] [2024-11-08 18:58:54,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:58:54,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:58:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:58:54,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:58:54,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:58:54,227 INFO L87 Difference]: Start difference. First operand 496 states and 697 transitions. Second operand has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 19 states have internal predecessors, (146), 6 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-08 18:58:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:58:55,089 INFO L93 Difference]: Finished difference Result 803 states and 1118 transitions. [2024-11-08 18:58:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:58:55,089 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 19 states have internal predecessors, (146), 6 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) Word has length 187 [2024-11-08 18:58:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:58:55,092 INFO L225 Difference]: With dead ends: 803 [2024-11-08 18:58:55,092 INFO L226 Difference]: Without dead ends: 581 [2024-11-08 18:58:55,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 18:58:55,093 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 970 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:58:55,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 768 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:58:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-08 18:58:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 508. [2024-11-08 18:58:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 460 states have (on average 1.3434782608695652) internal successors, (618), 460 states have internal predecessors, (618), 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-08 18:58:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 696 transitions. [2024-11-08 18:58:55,174 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 696 transitions. Word has length 187 [2024-11-08 18:58:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:58:55,174 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 696 transitions. [2024-11-08 18:58:55,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 19 states have internal predecessors, (146), 6 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-08 18:58:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 696 transitions. [2024-11-08 18:58:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 18:58:55,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:58:55,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:58:55,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:58:55,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:58:55,379 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:58:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:58:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -609662947, now seen corresponding path program 1 times [2024-11-08 18:58:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:58:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133862196] [2024-11-08 18:58:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:58:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:58:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:58:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:58:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:58:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:58:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:58:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:58:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:58:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:58:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:58:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:58:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:58:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:58:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 18:58:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 18:58:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 18:58:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 18:58:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:57,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 18:58:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 18:58:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:58:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:58:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 18:58:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 18:58:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 18:58:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 18:58:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 18:58:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 18:58:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:58:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133862196] [2024-11-08 18:58:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133862196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:58:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595501833] [2024-11-08 18:58:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:58:58,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:58:58,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:58:58,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:58:58,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:58:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:58:58,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 18:58:58,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 101 proven. 738 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2024-11-08 18:59:00,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:59:12,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595501833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:59:12,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:59:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2024-11-08 18:59:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067155452] [2024-11-08 18:59:12,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:59:12,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 18:59:12,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:59:12,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 18:59:12,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 18:59:12,032 INFO L87 Difference]: Start difference. First operand 508 states and 696 transitions. Second operand has 25 states, 25 states have (on average 4.8) internal successors, (120), 25 states have internal predecessors, (120), 5 states have call successors, (52), 4 states have call predecessors, (52), 5 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2024-11-08 18:59:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:59:16,179 INFO L93 Difference]: Finished difference Result 1368 states and 1855 transitions. [2024-11-08 18:59:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 18:59:16,179 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.8) internal successors, (120), 25 states have internal predecessors, (120), 5 states have call successors, (52), 4 states have call predecessors, (52), 5 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) Word has length 187 [2024-11-08 18:59:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:59:16,184 INFO L225 Difference]: With dead ends: 1368 [2024-11-08 18:59:16,184 INFO L226 Difference]: Without dead ends: 991 [2024-11-08 18:59:16,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=599, Invalid=2941, Unknown=0, NotChecked=0, Total=3540 [2024-11-08 18:59:16,186 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 914 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:59:16,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 948 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 18:59:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-08 18:59:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 779. [2024-11-08 18:59:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 698 states have (on average 1.322349570200573) internal successors, (923), 698 states have internal predecessors, (923), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 18:59:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1053 transitions. [2024-11-08 18:59:16,311 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1053 transitions. Word has length 187 [2024-11-08 18:59:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:59:16,311 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1053 transitions. [2024-11-08 18:59:16,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.8) internal successors, (120), 25 states have internal predecessors, (120), 5 states have call successors, (52), 4 states have call predecessors, (52), 5 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2024-11-08 18:59:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1053 transitions. [2024-11-08 18:59:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 18:59:16,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:59:16,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:59:16,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:59:16,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:59:16,517 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:59:16,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:59:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1165344415, now seen corresponding path program 1 times [2024-11-08 18:59:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:59:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682956724] [2024-11-08 18:59:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:16,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:59:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:59:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:59:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 18:59:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:59:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 18:59:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:59:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 18:59:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:59:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 18:59:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:59:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:59:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:59:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:59:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 18:59:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 18:59:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 18:59:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 18:59:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 18:59:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 18:59:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 18:59:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 18:59:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 18:59:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 18:59:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 18:59:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 18:59:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 18:59:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 18:59:17,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:59:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682956724] [2024-11-08 18:59:17,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682956724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:59:17,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555020602] [2024-11-08 18:59:17,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:59:17,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:59:17,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:59:17,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:59:17,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:59:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:59:17,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 18:59:17,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:59:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 18:59:19,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:59:27,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_20~0 4294967296))) (and (or (= (mod c_~last_1_var_1_18~0 256) 0) (and (forall ((v_z_106 Int)) (or (< 4294967295 v_z_106) (forall ((v_z_111 Int) (v_y_111 Int)) (let ((.cse0 (* v_y_111 4294967296)) (.cse1 (* 4294967295 v_z_111))) (let ((.cse2 (+ .cse0 .cse1 .cse3))) (or (< 4294967295 (+ .cse0 .cse1)) (< v_z_111 0) (< (+ 4294967295 v_z_106) .cse2) (< .cse2 4294967296) (forall ((v_z_82 Int)) (or (< (+ v_z_111 .cse3) (+ (mod v_z_82 v_z_106) 4294967297)) (< 4294967295 v_z_82) (< v_z_82 0))) (< 4294967295 v_z_111))))))) (forall ((v_z_106 Int)) (or (< 4294967295 v_z_106) (forall ((v_z_111 Int) (v_y_111 Int)) (let ((.cse4 (* v_y_111 4294967296)) (.cse5 (* 4294967295 v_z_111))) (let ((.cse7 (+ .cse4 .cse5 .cse3)) (.cse6 (+ v_z_111 .cse3))) (or (< 4294967295 (+ .cse4 .cse5)) (forall ((v_z_82 Int)) (or (< .cse6 (+ (mod v_z_82 v_z_106) 1)) (< 4294967295 v_z_82) (< v_z_82 0))) (< v_z_111 0) (< (+ 4294967295 v_z_106) .cse7) (< .cse7 4294967296) (< 4294967295 .cse6))))))) (forall ((v_z_82 Int)) (or (forall ((v_z_110 Int)) (or (forall ((v_y_110 Int)) (let ((.cse9 (* v_y_110 4294967296)) (.cse10 (* 4294967295 v_z_110))) (let ((.cse8 (+ .cse9 .cse10))) (or (< .cse8 0) (< 4294967295 .cse8) (forall ((v_z_106 Int)) (or (< (+ v_z_110 .cse3) (+ (mod v_z_82 v_z_106) 4294967297)) (< 4294967295 v_z_106) (< v_z_106 (+ .cse9 .cse10 .cse3 1)))))))) (< 4294967295 v_z_110) (< v_z_110 0))) (< 4294967295 v_z_82) (< v_z_82 0))) (forall ((v_z_82 Int)) (or (forall ((v_z_110 Int)) (let ((.cse11 (+ v_z_110 .cse3))) (or (< v_z_110 0) (< 4294967295 .cse11) (forall ((v_z_106 Int) (v_y_110 Int)) (let ((.cse12 (* v_y_110 4294967296)) (.cse13 (* 4294967295 v_z_110))) (or (< (+ .cse12 .cse13) 0) (< 4294967295 v_z_106) (< v_z_106 (+ .cse12 .cse13 .cse3 1)) (< .cse11 (+ (mod v_z_82 v_z_106) 1)))))))) (< 4294967295 v_z_82) (< v_z_82 0))))) (or (and (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (let ((.cse14 (+ v_z_93 .cse3))) (or (< v_z_93 0) (< 4294967295 .cse14) (< .cse14 (+ (mod v_z_81 v_z_89) 1)) (forall ((v_y_93 Int)) (let ((.cse15 (* v_y_93 4294967296)) (.cse16 (* v_z_93 4294967295))) (let ((.cse17 (+ .cse15 .cse16 .cse3))) (or (< 4294967295 (+ .cse15 .cse16)) (< (+ v_z_89 4294967295) .cse17) (< .cse17 4294967296)))))))))) (< v_z_89 0))) (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (or (< (+ v_z_93 .cse3) (+ (mod v_z_81 v_z_89) 4294967297)) (< v_z_93 0) (< 4294967295 v_z_93) (forall ((v_y_93 Int)) (let ((.cse18 (* v_y_93 4294967296)) (.cse19 (* v_z_93 4294967295))) (let ((.cse20 (+ .cse18 .cse19 .cse3))) (or (< 4294967295 (+ .cse18 .cse19)) (< (+ v_z_89 4294967295) .cse20) (< .cse20 4294967296))))))))) (< 4294967295 v_z_89) (< v_z_89 0))) (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (or (< (+ v_z_93 .cse3) (+ (mod v_z_81 v_z_89) 4294967297)) (< v_z_93 0) (forall ((v_y_93 Int)) (let ((.cse21 (* v_y_93 4294967296)) (.cse22 (* v_z_93 4294967295))) (or (< v_z_89 (+ .cse21 .cse22 .cse3 1)) (< (+ .cse21 .cse22) 0)))) (< 4294967295 v_z_93))))) (< 4294967295 v_z_89) (< v_z_89 0))) (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (let ((.cse25 (+ v_z_93 .cse3))) (or (< v_z_93 0) (forall ((v_y_93 Int)) (let ((.cse23 (* v_y_93 4294967296)) (.cse24 (* v_z_93 4294967295))) (or (< v_z_89 (+ .cse23 .cse24 .cse3 1)) (< (+ .cse23 .cse24) 0)))) (< 4294967295 .cse25) (< .cse25 (+ (mod v_z_81 v_z_89) 1))))))) (< 4294967295 v_z_89) (< v_z_89 0)))) (= (mod c_~var_1_18~0 256) 0)) (or (= 64 c_~var_1_14~0) (and (forall ((v_z_96 Int)) (or (< 4294967295 v_z_96) (forall ((v_z_101 Int) (v_y_101 Int)) (let ((.cse26 (* v_y_101 4294967296)) (.cse27 (* 4294967295 v_z_101)) (.cse28 (+ v_z_101 .cse3))) (or (< v_z_96 (+ .cse26 .cse27 .cse3 1)) (< v_z_101 0) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< .cse28 (+ (mod v_z_80 v_z_96) 1)))) (< (+ .cse26 .cse27) 0) (< 4294967295 .cse28)))))) (forall ((v_z_96 Int)) (or (< 4294967295 v_z_96) (forall ((v_z_102 Int) (v_y_102 Int)) (let ((.cse30 (* v_y_102 4294967296)) (.cse31 (* 4294967295 v_z_102))) (let ((.cse29 (+ .cse30 .cse31 .cse3))) (or (< (+ v_z_96 4294967295) .cse29) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< (+ v_z_102 .cse3) (+ (mod v_z_80 v_z_96) 4294967297)))) (< v_z_102 0) (< 4294967295 v_z_102) (< 4294967295 (+ .cse30 .cse31)) (< .cse29 4294967296))))))) (forall ((v_z_96 Int)) (or (forall ((v_z_102 Int) (v_y_102 Int)) (let ((.cse34 (* v_y_102 4294967296)) (.cse35 (* 4294967295 v_z_102))) (let ((.cse33 (+ v_z_102 .cse3)) (.cse32 (+ .cse34 .cse35 .cse3))) (or (< (+ v_z_96 4294967295) .cse32) (< v_z_102 0) (< 4294967295 .cse33) (< 4294967295 (+ .cse34 .cse35)) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< .cse33 (+ (mod v_z_80 v_z_96) 1)) (< v_z_80 0))) (< .cse32 4294967296))))) (< 4294967295 v_z_96))) (forall ((v_z_96 Int)) (or (< 4294967295 v_z_96) (forall ((v_z_101 Int) (v_y_101 Int)) (let ((.cse36 (* v_y_101 4294967296)) (.cse37 (* 4294967295 v_z_101))) (or (< 4294967295 v_z_101) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< (+ v_z_101 .cse3) (+ (mod v_z_80 v_z_96) 4294967297)))) (< v_z_96 (+ .cse36 .cse37 .cse3 1)) (< v_z_101 0) (< (+ .cse36 .cse37) 0)))))))))) is different from false [2024-11-08 18:59:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 18:59:37,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555020602] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:59:37,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:59:37,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 10] total 22 [2024-11-08 18:59:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488927755] [2024-11-08 18:59:37,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:59:37,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:59:37,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:59:37,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:59:37,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=331, Unknown=7, NotChecked=38, Total=462 [2024-11-08 18:59:37,836 INFO L87 Difference]: Start difference. First operand 779 states and 1053 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-08 18:59:44,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-08 19:00:02,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (= (mod c_~var_1_18~0 256) 0)) (.cse58 (mod c_~last_1_var_1_17~0 4294967296)) (.cse23 (= 64 c_~var_1_14~0)) (.cse4 (mod c_~var_1_20~0 4294967296))) (let ((.cse5 (forall ((v_z_106 Int)) (or (< 4294967295 v_z_106) (forall ((v_z_111 Int) (v_y_111 Int)) (let ((.cse103 (* v_y_111 4294967296)) (.cse104 (* 4294967295 v_z_111))) (let ((.cse106 (+ .cse103 .cse104 .cse4)) (.cse105 (+ v_z_111 .cse4))) (or (< 4294967295 (+ .cse103 .cse104)) (forall ((v_z_82 Int)) (or (< .cse105 (+ (mod v_z_82 v_z_106) 1)) (< 4294967295 v_z_82) (< v_z_82 0))) (< v_z_111 0) (< (+ 4294967295 v_z_106) .cse106) (< .cse106 4294967296) (< 4294967295 .cse105)))))))) (.cse9 (forall ((v_z_82 Int)) (or (forall ((v_z_110 Int)) (let ((.cse100 (+ v_z_110 .cse4))) (or (< v_z_110 0) (< 4294967295 .cse100) (forall ((v_z_106 Int) (v_y_110 Int)) (let ((.cse101 (* v_y_110 4294967296)) (.cse102 (* 4294967295 v_z_110))) (or (< (+ .cse101 .cse102) 0) (< 4294967295 v_z_106) (< v_z_106 (+ .cse101 .cse102 .cse4 1)) (< .cse100 (+ (mod v_z_82 v_z_106) 1)))))))) (< 4294967295 v_z_82) (< v_z_82 0)))) (.cse24 (forall ((v_z_96 Int)) (or (< 4294967295 v_z_96) (forall ((v_z_101 Int) (v_y_101 Int)) (let ((.cse97 (* v_y_101 4294967296)) (.cse98 (* 4294967295 v_z_101)) (.cse99 (+ v_z_101 .cse4))) (or (< v_z_96 (+ .cse97 .cse98 .cse4 1)) (< v_z_101 0) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< .cse99 (+ (mod v_z_80 v_z_96) 1)))) (< (+ .cse97 .cse98) 0) (< 4294967295 .cse99))))))) (.cse28 (forall ((v_z_96 Int)) (or (forall ((v_z_102 Int) (v_y_102 Int)) (let ((.cse95 (* v_y_102 4294967296)) (.cse96 (* 4294967295 v_z_102))) (let ((.cse94 (+ v_z_102 .cse4)) (.cse93 (+ .cse95 .cse96 .cse4))) (or (< (+ v_z_96 4294967295) .cse93) (< v_z_102 0) (< 4294967295 .cse94) (< 4294967295 (+ .cse95 .cse96)) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< .cse94 (+ (mod v_z_80 v_z_96) 1)) (< v_z_80 0))) (< .cse93 4294967296))))) (< 4294967295 v_z_96)))) (.cse55 (not (= c_~last_1_var_1_17~0 c_~var_1_17~0))) (.cse53 (or (and (forall ((v_z_96 Int)) (or (forall ((v_z_102 Int) (v_y_102 Int)) (let ((.cse83 (* v_y_102 4294967296)) (.cse84 (* 4294967295 v_z_102))) (let ((.cse81 (+ .cse83 .cse84 .cse58)) (.cse82 (+ v_z_102 .cse58))) (or (< .cse81 4294967296) (< 4294967295 .cse82) (< (+ v_z_96 4294967295) .cse81) (< v_z_102 0) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< .cse82 (+ (mod v_z_80 v_z_96) 1)) (< v_z_80 0))) (< 4294967295 (+ .cse83 .cse84)))))) (< 4294967295 v_z_96))) (forall ((v_z_96 Int)) (or (forall ((v_z_102 Int) (v_y_102 Int)) (let ((.cse86 (* v_y_102 4294967296)) (.cse87 (* 4294967295 v_z_102))) (let ((.cse85 (+ .cse86 .cse87 .cse58))) (or (< .cse85 4294967296) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< (+ v_z_102 .cse58) (+ (mod v_z_80 v_z_96) 4294967297)))) (< (+ v_z_96 4294967295) .cse85) (< 4294967295 v_z_102) (< 4294967295 (+ .cse86 .cse87)))))) (< 4294967295 v_z_96))) (forall ((v_z_96 Int)) (or (forall ((v_z_101 Int) (v_y_101 Int)) (let ((.cse88 (* v_y_101 4294967296)) (.cse89 (* 4294967295 v_z_101))) (or (< v_z_96 (+ .cse88 .cse89 .cse58 1)) (< 4294967295 v_z_101) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< (+ v_z_101 .cse58) (+ (mod v_z_80 v_z_96) 4294967297)))) (< (+ .cse88 .cse89) 0)))) (< 4294967295 v_z_96))) (forall ((v_z_96 Int)) (or (forall ((v_z_101 Int) (v_y_101 Int)) (let ((.cse92 (+ v_z_101 .cse58)) (.cse90 (* v_y_101 4294967296)) (.cse91 (* 4294967295 v_z_101))) (or (< v_z_96 (+ .cse90 .cse91 .cse58 1)) (< v_z_101 0) (< 4294967295 .cse92) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< .cse92 (+ (mod v_z_80 v_z_96) 1)))) (< (+ .cse90 .cse91) 0)))) (< 4294967295 v_z_96)))) .cse23)) (.cse54 (or .cse22 (and (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (let ((.cse69 (+ v_z_93 .cse58))) (or (< v_z_93 0) (< 4294967295 .cse69) (forall ((v_y_93 Int)) (let ((.cse71 (* v_y_93 4294967296)) (.cse72 (* v_z_93 4294967295))) (let ((.cse70 (+ .cse71 .cse72 .cse58))) (or (< (+ v_z_89 4294967295) .cse70) (< .cse70 4294967296) (< 4294967295 (+ .cse71 .cse72)))))) (< .cse69 (+ (mod v_z_81 v_z_89) 1))))))) (< 4294967295 v_z_89))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (or (forall ((v_y_93 Int)) (let ((.cse73 (* v_y_93 4294967296)) (.cse74 (* v_z_93 4294967295))) (or (< v_z_89 (+ .cse73 .cse74 .cse58 1)) (< (+ .cse73 .cse74) 0)))) (< (+ v_z_93 .cse58) (+ (mod v_z_81 v_z_89) 4294967297)) (< 4294967295 v_z_93))))))) (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (forall ((v_z_93 Int)) (or (< (+ v_z_93 .cse58) (+ (mod v_z_81 v_z_89) 4294967297)) (< 4294967295 v_z_93) (forall ((v_y_93 Int)) (let ((.cse76 (* v_y_93 4294967296)) (.cse77 (* v_z_93 4294967295))) (let ((.cse75 (+ .cse76 .cse77 .cse58))) (or (< (+ v_z_89 4294967295) .cse75) (< .cse75 4294967296) (< 4294967295 (+ .cse76 .cse77)))))))) (< v_z_81 0) (< 4294967295 v_z_81))) (< 4294967295 v_z_89))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_z_81 Int)) (or (forall ((v_z_93 Int)) (let ((.cse80 (+ v_z_93 .cse58))) (or (forall ((v_y_93 Int)) (let ((.cse78 (* v_y_93 4294967296)) (.cse79 (* v_z_93 4294967295))) (or (< v_z_89 (+ .cse78 .cse79 .cse58 1)) (< (+ .cse78 .cse79) 0)))) (< v_z_93 0) (< 4294967295 .cse80) (< .cse80 (+ (mod v_z_81 v_z_89) 1))))) (< v_z_81 0) (< 4294967295 v_z_81)))))))) (.cse0 (= (mod c_~last_1_var_1_18~0 256) 0))) (and (or .cse0 (and (forall ((v_z_106 Int)) (or (< 4294967295 v_z_106) (forall ((v_z_111 Int) (v_y_111 Int)) (let ((.cse1 (* v_y_111 4294967296)) (.cse2 (* 4294967295 v_z_111))) (let ((.cse3 (+ .cse1 .cse2 .cse4))) (or (< 4294967295 (+ .cse1 .cse2)) (< v_z_111 0) (< (+ 4294967295 v_z_106) .cse3) (< .cse3 4294967296) (forall ((v_z_82 Int)) (or (< (+ v_z_111 .cse4) (+ (mod v_z_82 v_z_106) 4294967297)) (< 4294967295 v_z_82) (< v_z_82 0))) (< 4294967295 v_z_111))))))) .cse5 (forall ((v_z_82 Int)) (or (forall ((v_z_110 Int)) (or (forall ((v_y_110 Int)) (let ((.cse7 (* v_y_110 4294967296)) (.cse8 (* 4294967295 v_z_110))) (let ((.cse6 (+ .cse7 .cse8))) (or (< .cse6 0) (< 4294967295 .cse6) (forall ((v_z_106 Int)) (or (< (+ v_z_110 .cse4) (+ (mod v_z_82 v_z_106) 4294967297)) (< 4294967295 v_z_106) (< v_z_106 (+ .cse7 .cse8 .cse4 1)))))))) (< 4294967295 v_z_110) (< v_z_110 0))) (< 4294967295 v_z_82) (< v_z_82 0))) .cse9)) (or (and (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (let ((.cse10 (+ v_z_93 .cse4))) (or (< v_z_93 0) (< 4294967295 .cse10) (< .cse10 (+ (mod v_z_81 v_z_89) 1)) (forall ((v_y_93 Int)) (let ((.cse11 (* v_y_93 4294967296)) (.cse12 (* v_z_93 4294967295))) (let ((.cse13 (+ .cse11 .cse12 .cse4))) (or (< 4294967295 (+ .cse11 .cse12)) (< (+ v_z_89 4294967295) .cse13) (< .cse13 4294967296)))))))))) (< v_z_89 0))) (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (or (< (+ v_z_93 .cse4) (+ (mod v_z_81 v_z_89) 4294967297)) (< v_z_93 0) (< 4294967295 v_z_93) (forall ((v_y_93 Int)) (let ((.cse14 (* v_y_93 4294967296)) (.cse15 (* v_z_93 4294967295))) (let ((.cse16 (+ .cse14 .cse15 .cse4))) (or (< 4294967295 (+ .cse14 .cse15)) (< (+ v_z_89 4294967295) .cse16) (< .cse16 4294967296))))))))) (< 4294967295 v_z_89) (< v_z_89 0))) (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (or (< (+ v_z_93 .cse4) (+ (mod v_z_81 v_z_89) 4294967297)) (< v_z_93 0) (forall ((v_y_93 Int)) (let ((.cse17 (* v_y_93 4294967296)) (.cse18 (* v_z_93 4294967295))) (or (< v_z_89 (+ .cse17 .cse18 .cse4 1)) (< (+ .cse17 .cse18) 0)))) (< 4294967295 v_z_93))))) (< 4294967295 v_z_89) (< v_z_89 0))) (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (let ((.cse21 (+ v_z_93 .cse4))) (or (< v_z_93 0) (forall ((v_y_93 Int)) (let ((.cse19 (* v_y_93 4294967296)) (.cse20 (* v_z_93 4294967295))) (or (< v_z_89 (+ .cse19 .cse20 .cse4 1)) (< (+ .cse19 .cse20) 0)))) (< 4294967295 .cse21) (< .cse21 (+ (mod v_z_81 v_z_89) 1))))))) (< 4294967295 v_z_89) (< v_z_89 0)))) .cse22) (or .cse23 (and .cse24 (forall ((v_z_96 Int)) (or (< 4294967295 v_z_96) (forall ((v_z_102 Int) (v_y_102 Int)) (let ((.cse26 (* v_y_102 4294967296)) (.cse27 (* 4294967295 v_z_102))) (let ((.cse25 (+ .cse26 .cse27 .cse4))) (or (< (+ v_z_96 4294967295) .cse25) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< (+ v_z_102 .cse4) (+ (mod v_z_80 v_z_96) 4294967297)))) (< v_z_102 0) (< 4294967295 v_z_102) (< 4294967295 (+ .cse26 .cse27)) (< .cse25 4294967296))))))) .cse28 (forall ((v_z_96 Int)) (or (< 4294967295 v_z_96) (forall ((v_z_101 Int) (v_y_101 Int)) (let ((.cse29 (* v_y_101 4294967296)) (.cse30 (* 4294967295 v_z_101))) (or (< 4294967295 v_z_101) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< (+ v_z_101 .cse4) (+ (mod v_z_80 v_z_96) 4294967297)))) (< v_z_96 (+ .cse29 .cse30 .cse4 1)) (< v_z_101 0) (< (+ .cse29 .cse30) 0)))))))) (or (and (or .cse0 (and (forall ((v_z_82 Int)) (or (forall ((v_z_110 Int)) (or (< 4294967295 v_z_110) (forall ((v_y_110 Int)) (let ((.cse31 (* v_y_110 4294967296)) (.cse32 (* 4294967295 v_z_110))) (or (< (+ .cse31 .cse32) 0) (forall ((v_z_106 Int)) (or (< (+ v_z_110 .cse4) (+ (mod v_z_82 v_z_106) 4294967297)) (< 4294967295 v_z_106) (< v_z_106 (+ .cse31 .cse32 .cse4 1))))))))) (< 4294967295 v_z_82) (< v_z_82 0))) (forall ((v_z_106 Int)) (or (< 4294967295 v_z_106) (forall ((v_z_111 Int) (v_y_111 Int)) (let ((.cse33 (* v_y_111 4294967296)) (.cse34 (* 4294967295 v_z_111))) (let ((.cse35 (+ .cse33 .cse34 .cse4))) (or (< 4294967295 (+ .cse33 .cse34)) (< (+ 4294967295 v_z_106) .cse35) (< .cse35 4294967296) (forall ((v_z_82 Int)) (or (< (+ v_z_111 .cse4) (+ (mod v_z_82 v_z_106) 4294967297)) (< 4294967295 v_z_82) (< v_z_82 0))) (< 4294967295 v_z_111))))))) .cse5 .cse9)) (or .cse22 (and (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (or (< (+ v_z_93 .cse4) (+ (mod v_z_81 v_z_89) 4294967297)) (forall ((v_y_93 Int)) (let ((.cse36 (* v_y_93 4294967296)) (.cse37 (* v_z_93 4294967295))) (or (< v_z_89 (+ .cse36 .cse37 .cse4 1)) (< (+ .cse36 .cse37) 0)))) (< 4294967295 v_z_93))))) (< 4294967295 v_z_89))) (forall ((v_z_89 Int)) (or (< 4294967295 v_z_89) (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (let ((.cse38 (+ v_z_93 .cse4))) (or (< v_z_93 0) (< 4294967295 .cse38) (< .cse38 (+ (mod v_z_81 v_z_89) 1)) (forall ((v_y_93 Int)) (let ((.cse39 (* v_y_93 4294967296)) (.cse40 (* v_z_93 4294967295))) (let ((.cse41 (+ .cse39 .cse40 .cse4))) (or (< 4294967295 (+ .cse39 .cse40)) (< (+ v_z_89 4294967295) .cse41) (< .cse41 4294967296)))))))))))) (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (let ((.cse44 (+ v_z_93 .cse4))) (or (< v_z_93 0) (forall ((v_y_93 Int)) (let ((.cse42 (* v_y_93 4294967296)) (.cse43 (* v_z_93 4294967295))) (or (< v_z_89 (+ .cse42 .cse43 .cse4 1)) (< (+ .cse42 .cse43) 0)))) (< 4294967295 .cse44) (< .cse44 (+ (mod v_z_81 v_z_89) 1))))))) (< 4294967295 v_z_89))) (forall ((v_z_89 Int)) (or (forall ((v_z_81 Int)) (or (< v_z_81 0) (< 4294967295 v_z_81) (forall ((v_z_93 Int)) (or (< (+ v_z_93 .cse4) (+ (mod v_z_81 v_z_89) 4294967297)) (< 4294967295 v_z_93) (forall ((v_y_93 Int)) (let ((.cse45 (* v_y_93 4294967296)) (.cse46 (* v_z_93 4294967295))) (let ((.cse47 (+ .cse45 .cse46 .cse4))) (or (< 4294967295 (+ .cse45 .cse46)) (< (+ v_z_89 4294967295) .cse47) (< .cse47 4294967296))))))))) (< 4294967295 v_z_89))))) (or .cse23 (and .cse24 (forall ((v_z_96 Int)) (or (forall ((v_z_101 Int) (v_y_101 Int)) (let ((.cse48 (* v_y_101 4294967296)) (.cse49 (* 4294967295 v_z_101))) (or (< 4294967295 v_z_101) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< (+ v_z_101 .cse4) (+ (mod v_z_80 v_z_96) 4294967297)))) (< v_z_96 (+ .cse48 .cse49 .cse4 1)) (< (+ .cse48 .cse49) 0)))) (< 4294967295 v_z_96))) .cse28 (forall ((v_z_96 Int)) (or (< 4294967295 v_z_96) (forall ((v_z_102 Int) (v_y_102 Int)) (let ((.cse51 (* v_y_102 4294967296)) (.cse52 (* 4294967295 v_z_102))) (let ((.cse50 (+ .cse51 .cse52 .cse4))) (or (< (+ v_z_96 4294967295) .cse50) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< v_z_80 0) (< (+ v_z_102 .cse4) (+ (mod v_z_80 v_z_96) 4294967297)))) (< 4294967295 v_z_102) (< 4294967295 (+ .cse51 .cse52)) (< .cse50 4294967296)))))))))) (not (= c_~var_1_20~0 c_~var_1_17~0))) (or (and .cse53 .cse54) .cse55) (or .cse55 (and .cse53 .cse54 (or .cse0 (and (forall ((v_z_82 Int)) (or (forall ((v_z_110 Int)) (or (forall ((v_y_110 Int)) (let ((.cse56 (* v_y_110 4294967296)) (.cse57 (* 4294967295 v_z_110))) (or (< (+ .cse56 .cse57) 0) (forall ((v_z_106 Int)) (or (< v_z_106 (+ .cse56 .cse57 .cse58 1)) (< 4294967295 v_z_106) (< (+ v_z_110 .cse58) (+ (mod v_z_82 v_z_106) 4294967297))))))) (< 4294967295 v_z_110))) (< 4294967295 v_z_82) (< v_z_82 0))) (forall ((v_z_106 Int)) (or (< 4294967295 v_z_106) (forall ((v_z_111 Int) (v_y_111 Int)) (let ((.cse59 (* v_y_111 4294967296)) (.cse60 (* 4294967295 v_z_111))) (let ((.cse61 (+ .cse59 .cse60 .cse58))) (or (< 4294967295 (+ .cse59 .cse60)) (forall ((v_z_82 Int)) (or (< (+ v_z_111 .cse58) (+ (mod v_z_82 v_z_106) 4294967297)) (< 4294967295 v_z_82) (< v_z_82 0))) (< (+ 4294967295 v_z_106) .cse61) (< .cse61 4294967296) (< 4294967295 v_z_111))))))) (forall ((v_z_82 Int)) (or (forall ((v_z_110 Int)) (let ((.cse64 (+ v_z_110 .cse58))) (or (forall ((v_z_106 Int) (v_y_110 Int)) (let ((.cse62 (* v_y_110 4294967296)) (.cse63 (* 4294967295 v_z_110))) (or (< (+ .cse62 .cse63) 0) (< v_z_106 (+ .cse62 .cse63 .cse58 1)) (< .cse64 (+ (mod v_z_82 v_z_106) 1)) (< 4294967295 v_z_106)))) (< 4294967295 .cse64) (< v_z_110 0)))) (< 4294967295 v_z_82) (< v_z_82 0))) (forall ((v_z_106 Int)) (or (< 4294967295 v_z_106) (forall ((v_z_111 Int) (v_y_111 Int)) (let ((.cse66 (* v_y_111 4294967296)) (.cse67 (* 4294967295 v_z_111))) (let ((.cse65 (+ v_z_111 .cse58)) (.cse68 (+ .cse66 .cse67 .cse58))) (or (< 4294967295 .cse65) (< 4294967295 (+ .cse66 .cse67)) (< v_z_111 0) (forall ((v_z_82 Int)) (or (< .cse65 (+ (mod v_z_82 v_z_106) 1)) (< 4294967295 v_z_82) (< v_z_82 0))) (< (+ 4294967295 v_z_106) .cse68) (< .cse68 4294967296)))))))))))))) is different from false [2024-11-08 19:00:04,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-08 19:00:11,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-08 19:00:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:00:11,359 INFO L93 Difference]: Finished difference Result 1563 states and 2077 transitions. [2024-11-08 19:00:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 19:00:11,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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 187 [2024-11-08 19:00:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:00:11,367 INFO L225 Difference]: With dead ends: 1563 [2024-11-08 19:00:11,367 INFO L226 Difference]: Without dead ends: 1289 [2024-11-08 19:00:11,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=134, Invalid=498, Unknown=26, NotChecked=98, Total=756 [2024-11-08 19:00:11,369 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 203 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 14 mSolverCounterUnsat, 255 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 255 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:00:11,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 638 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 283 Invalid, 255 Unknown, 206 Unchecked, 21.5s Time] [2024-11-08 19:00:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-08 19:00:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 803. [2024-11-08 19:00:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 722 states have (on average 1.3254847645429362) internal successors, (957), 722 states have internal predecessors, (957), 65 states have call successors, (65), 15 states have call predecessors, (65), 15 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 19:00:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1087 transitions. [2024-11-08 19:00:11,538 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1087 transitions. Word has length 187 [2024-11-08 19:00:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:00:11,539 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1087 transitions. [2024-11-08 19:00:11,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-08 19:00:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1087 transitions. [2024-11-08 19:00:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 19:00:11,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:00:11,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:00:11,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 19:00:11,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-08 19:00:11,744 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:00:11,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:00:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1037361262, now seen corresponding path program 1 times [2024-11-08 19:00:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:00:11,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338181107] [2024-11-08 19:00:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:00:11,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:00:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:00:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:00:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:00:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:00:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:00:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:00:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:00:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:00:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:00:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:00:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:00:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:00:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:00:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:00:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:00:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:00:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:00:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:00:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:00:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:00:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:00:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 19:00:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 19:00:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 19:00:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 19:00:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 19:00:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:00:12,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:00:12,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338181107] [2024-11-08 19:00:12,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338181107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:00:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771353794] [2024-11-08 19:00:12,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:00:12,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:00:12,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:00:12,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:00:12,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f74f794-5cb4-4b8e-94e8-f98cff23ff61/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:00:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:12,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 19:00:12,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:00:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 19:00:14,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:00:34,727 WARN L286 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 499 DAG size of output: 481 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:00:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 19:00:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771353794] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 19:00:58,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:00:58,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 10] total 21 [2024-11-08 19:00:58,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864639481] [2024-11-08 19:00:58,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:00:58,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:00:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:00:58,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:00:58,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=328, Unknown=12, NotChecked=0, Total=420 [2024-11-08 19:00:58,357 INFO L87 Difference]: Start difference. First operand 803 states and 1087 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-08 19:01:11,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]